✦ LIBER ✦

Computing Permutation Encodings

✍ Scribed by K. Rustan M. Leino

Publisher: Springer
Year: 1999
Tongue: English
Weight: 127 KB
Volume: 11
Category: Article
ISSN: 0934-5043
DOI: 10.1007/s001650050036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing normalizers in permutation gro

Computing normalizers in permutation groups

✍ Gregory Butler 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 641 KB

Computing Sylow Subgroups in Permutation

Computing Sylow Subgroups in Permutation Groups

✍ JOHN CANNON; BRUCE COX; DEREK HOLT 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 371 KB

We describe the theory and implementation of a practical algorithm for computing a Sylow subgroup of a permutation group and for finding an element that conjugates one Sylow subgroup to another. The performance of the current implementations in the Magma system represents a significant improvement o

Computing the Subgroups of a Permutation

Computing the Subgroups of a Permutation Group

✍ John J. Cannon; Bruce C. Cox; Derek F. Holt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 279 KB

A new method for computing the conjugacy classes of subgroups of a finite group is described.

Procedures of encoding and decoding of p

Procedures of encoding and decoding of permutations

✍ A. A. Babaev 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 232 KB

Computing Bases for Rings of Permutation

Computing Bases for Rings of Permutation-invariant Polynomials

✍ Manfred Göbel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Let \(R\) be a commutative ring with 1 , let \(R\left[X_{1}, \ldots, X_{n}\right]\) be the polynomial ring in \(X_{1}, \ldots, X_{n}\) over \(R\) and let \(G\) be an arbitrary group of permutations of \(\left\{X_{1}, \ldots, X_{n}\right\}\). The paper presents an algorithm for computing a small fini

Minimal string difference encodings

✍ Robert N Goldberg 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 535 KB