The search session has expired. Please query the service again.
The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on the performances, and proposing useful improvements. In particular, a new simplified version of this algorithm is described, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed for factoring....
We present a method of bounding incomplete character sums for finite abelian groups with arguments produced by a first-order recursion. This method is particularly effective if the recursion involves a special type of permutation called an -orthomorphism. Examples of -orthomorphisms are given.
For each global field of positive characteristic we exhibit many examples of two-variable algebraic functions possessing properties consistent with a conjectural refinement of the Stark conjecture in the function field case recently proposed by the author. All the examples are Coleman units. We obtain our results by studying rank one shtukas in which both zero and pole are generic, i. e., shtukas not associated to any Drinfeld module.
1. Introduction. Let K be a field of characteristic p ≥ 0 and let f(X) be a polynomial of degree at least two with coefficients in K. We set f₁(X) = f(X) and define for all r ≥ 1. Following R. W. K. Odoni [7], we say that f is stable over K if is irreducible over K for every r ≥ 1. In [6] the same author proved that the polynomial f(X) = X² - X + 1 is stable over ℚ. He wrote in [7] that the proof given there is quite difficult and it would be of interest to have an elementary proof. In the sequel...
Currently displaying 1 –
13 of
13