#### Filter Results:

#### Publication Year

2003

2013

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Dragos Ghioca, Thomas J Tucker, Michael E Zieve
- 2007

We prove that if nonlinear complex polynomials of the same degree have orbits with infinite intersection, then the polynomials have a common iterate. We also prove a dynamical analogue of the Mordell-Lang conjecture.

- Dragos Ghioca, Thomas J Tucker, Michael E Zieve
- 2011

We study the orbits of a polynomial f ∈ C[X], namely the sets {α, f (α), f (f (α)),. .. } with α ∈ C. We prove that if two nonlinear complex polynomials f, g have orbits with infinite intersection, then f and g have a common iterate. More generally, we describe the intersection of any line in C d with a d-tuple of orbits of nonlinear polynomials, and we… (More)

- Robert M Guralnick, Joel E Rosenberg, Michael E Zieve
- 2008

We produce a new family of polynomials f (X) over fields k of characteristic 2 which are exceptional, in the sense that f (X) − f (Y) has no absolutely irreducible factors in k[X, Y ] except for scalar multiples of X −Y ; when k is finite, this condition is equivalent to saying that the map α → f (α) induces a bijection on an infinite algebraic extension of… (More)

Let k be a field of characteristic p > 0, and let q be a power of p. We determine all polynomials f ∈ k[t] \ k[t p ] of degree q(q − 1)/2 such that Gal(f (t) − u, k(u)) has a transitive normal subgroup isomor-phic to PSL2(q), subject to a certain ramification hypothesis. As a consequence, we describe all polynomials f ∈ k[t] such that deg(f) is not a power… (More)

We present a general technique for obtaining permutation polynomials over a finite field from permutations of a sub-field. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new families of permutation polynomials. Some of these have the additional property that both f (x) and f (x) + x induce… (More)

We resolve a 1983 question of Serre by constructing curves with many points of every genus over every finite field. More precisely, we show that for every prime power q there is a positive constant c q with the following property: for every integer g ≥ 0, there is a genus-g curve over F q with at least c q g rational points over F q. Moreover, we show that… (More)

For a fixed prime p, we consider the set of maps Z/pZ → Z/pZ of the form a → Tn(a), where Tn(x) is the degree-n Chebyshev polynomial of the first kind. We observe that these maps form a semigroup, and we determine its size and structure.

Suppose x m +ax n is a permutation polynomial over F p , where p > 5 is prime and m > n > 0 and a ∈ F * p. We prove that gcd(m−n, p−1) / ∈ {2, 4}. In the special case that either (p − 1)/2 or (p − 1)/4 is prime, this was conjectured in a recent paper by Masuda, Panario and Wang.

- ‹
- 1
- ›