✦ LIBER ✦

A Practical Algorithm for Finding Matrix Representations for Polycyclic Groups

✍ Scribed by Eddie H. Lo; Gretchen Ostheimer

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 365 KB
Volume: 28
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1999.0286

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we describe a new algorithm for constructing a representation by integer matrices for a polycyclic group given by a finite presentation. This is a first step toward finding a practical algorithm for this problem. We used our algorithm to construct representations for various polycyclic groups. The examples which we studied included a collection of free nilpotent groups, and our results here led us to a new theoretical result concerning such groups.

📜 SIMILAR VOLUMES

Practical Algorithms for Polycyclic Matr

Practical Algorithms for Polycyclic Matrix Groups

✍ Gretchen Ostheimer 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 322 KB

In this paper we describe a suite of new algorithms for studying polycyclic matrix groups-algorithms for testing membership and for uncovering the polycyclic structure of the group. We also describe an algorithm for deciding whether or not a group is solvable, which, in the important context of subg

A practical algorithm for faster matrix

A practical algorithm for faster matrix multiplication

✍ Igor Kaporin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab