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 computatio
โฆ LIBER โฆ
Homogeneous computing structures over a finite field
โ Scribed by Sh. R. Nurutdinov
- Book ID
- 105465861
- Publisher
- Springer US
- Year
- 1994
- Tongue
- English
- Weight
- 249 KB
- Volume
- 71
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Idempotent Computation over Finite Field
โ
Richard A. Davis
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 738 KB
Computational Complexity over Finite Fie
โ
Strassen, Volker
๐
Article
๐
1976
๐
Society for Industrial and Applied Mathematics
๐
English
โ 682 KB
Computing in unitriangular matrices over
โ
Antonio Vera-Lรณpez; J.M Arregi
๐
Article
๐
2004
๐
Elsevier Science
๐
English
โ 285 KB
Communication complexity of matrix compu
โ
J. I. Chu; G. Schnitger
๐
Article
๐
1995
๐
Springer
๐
English
โ 764 KB
The computer construction of matrix repr
โ
R.A. Parker; R.A. Wilson
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 517 KB
Given an abstract group G it is important to be able to find explicit generators for a concrete group isomorphic to G, in order to perform calculations with the group. In this paper we describe a method of using the "Meat-axe" to construct explicit matrix generators for a given group.
Computing lower bounds on tensor rank ov
โ
Sharon J. Laskowski
๐
Article
๐
1982
๐
Elsevier Science
๐
English
โ 581 KB