All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 13 of 13

Showing per page

Improvements on the Cantor-Zassenhaus factorization algorithm

Michele Elia, Davide Schipani (2015)

Mathematica Bohemica

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....

Incomplete character sums and a special class of permutations

S. D. Cohen, H. Niederreiter, I. E. Shparlinski, M. Zieve (2001)

Journal de théorie des nombres de Bordeaux

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.

Interpolation of hypergeometric ratios in a global field of positive characteristic

Greg W. Anderson (2007)

Annales de l’institut Fourier

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.

Irreducibility of the iterates of a quadratic polynomial over a field

Mohamed Ayad, Donald L. McQuillan (2000)

Acta Arithmetica

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 f r + 1 ( X ) = f ( f r ( X ) ) for all r ≥ 1. Following R. W. K. Odoni [7], we say that f is stable over K if f r ( X ) 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

Page 1