✦ LIBER ✦

On the factorisation of polynomials in a finite number of steps

✍ Scribed by A. Fröhlich; J. C. Shepherdson

Publisher: Springer-Verlag
Year: 1955
Tongue: French
Weight: 282 KB
Volume: 62
Category: Article
ISSN: 0025-5874
DOI: 10.1007/bf01180640

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of steps in a finite JACOBI a

The number of steps in a finite JACOBI algorithm

✍ Roland Fischer; Fritz Schweiger 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 396 KB

On the factorisation of finite abelian g

On the factorisation of finite abelian groups

✍ Arthur D. Sands 📂 Article 📅 1957 🏛 Akadmiai Kiad 🌐 English ⚖ 960 KB

On the factorisation of finite abelian g

On the factorisation of finite abelian groups. III

✍ A. D. Sands 📂 Article 📅 1974 🏛 Akadmiai Kiad 🌐 English ⚖ 391 KB

On the factorisation of finite abelian g

On the factorisation of finite abelian groups. II

✍ A. D. Sands 📂 Article 📅 1962 🏛 Akadmiai Kiad 🌐 English ⚖ 1000 KB

On Classifying All Full Factorisations a

On Classifying All Full Factorisations and Multiple-Factorisations of the Finite Almost Simple Groups

✍ Robert W Baddeley; Cheryl E Praeger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 560 KB

We present some general results on factorisations of almost simple groups. These results are consequences of the classification of all maximal factorisations of Ž . almost simple groups due to Liebeck, Saxl, and the second author , and are needed for applications to the theory of quasiprimitive perm

The Number of Permutation Polynomials of

The Number of Permutation Polynomials of a Given Degree Over a Finite Field

✍ Pinaki Das 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 139 KB

We relate the number of permutation polynomials in F q ½x of degree d q À 2 to the solutions ðx 1 ; x 2 ; . . . ; x q Þ of a system of linear equations over F q , with the added restriction that x i =0 and x i =x j whenever i=j. Using this we find an expression for the number of permutation polynomi