✦ LIBER ✦

Idempotent Computation over Finite Fields

✍ Scribed by Richard A. Davis

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 738 KB
Volume: 17
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1015

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we provide an account of several new techniques for computing the primitive idempotents of a commutative artinian algebra over a finite field. Examples of such algebras include the center of a finite group algebra or any finite dimensional quotient of a polynomial ring. The computational methods described are applicable in fairly general situations and the algorithms presented are easily programmed. Both pseudocode and operation counts are provided. As an application, the problem of fsctoring polynomials over finite fields is discussed.

📜 SIMILAR VOLUMES

Computing lower bounds on tensor rank ov

Computing lower bounds on tensor rank over finite fields

✍ Sharon J. Laskowski 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Exceptional Polynomials over Finite Fiel

Exceptional Polynomials over Finite Fields

✍ S.D. Cohen; R.W. Matthews 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 641 KB

A recently discovered family of indecomposable polynomials of nonprime power degree over \(\mathbb{F}_{2}\) (which include a class of exceptional polynomials) is set against the background of the classical families and their monodromy groups are obtained without recourse to the classification of fin

Diagonal forms over finite fields

✍ Brother Joseph Heisler 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 90 KB

Fermat curves over finite fields

✍ A. Garcia; J.F. Voloch 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 518 KB

Finite Upper Half Planes over Finite Fie

Finite Upper Half Planes over Finite Fields

✍ Jeff Angel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Finite upper half planes have been studied by Terras, Poulos, Celniker, Trimble, and Velasquez. Motivated by Stark's p-adic upper half plane as a p-adic analog of the Poincare ´upper half plane, a finite field of odd characteristic was used as the finite analog of the real line. The analog of the up

Explicit Computation of Isomorphisms bet

Explicit Computation of Isomorphisms between Finite Fields

✍ Bill Allombert 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Although it is easy to prove that two finite fields having the same cardinality are isomorphic, the proof uses embeddings into an algebraic closure (or at least into a common overfield), hence is not constructive, and so does not provide explicit isomorphisms. We give algorithms to solve this proble