Search

We recall that a polynomial f(X) ∈ K[X] over a field K is called stable if all its iterates are irreducible over K. We show that almost all monic quadratic polynomials f(X) ∈ ℤ[X] are stable over ℚ. We also show that the presence of squares in so-called critical orbits of a quadratic polynomial f(X) ∈ ℤ[X] can be detected by a finite algorithm; this property is closely related to the stability of f(X). We also prove there are no stable quadratic polynomials over finite fields of characteristic 2 but they exist over some infinite fields of characteristic 2.

Let E be an ordinary elliptic curve over a finite field q of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative character sums. We apply these bounds to some variants of the sum-product problem on E.

Search Results

Refine search

Refine search

Actions for selected content:

3 results

6 - Curves over finite fields and linear recurring sequences

ON STABLE QUADRATIC POLYNOMIALS

Bilinear character sums and sum-product problems on elliptic curves

Search Results

Refine search

Refine search

Actions for selected content:

Save Search

3 results

6 - Curves over finite fields and linear recurring sequences

ON STABLE QUADRATIC POLYNOMIALS

Bilinear character sums and sum-product problems on elliptic curves