๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of the weight problem for permutation and matrix groups

โœ Scribed by Peter J. Cameron; Taoyang Wu

Book ID
108114134
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
536 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The graphical complexity of direct produ
The graphical complexity of direct products of permutation groups
โœ Mariusz Grech ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 167 KB

In this article, we improve known results, and, with one exceptional case, prove that when k โ‰ฅ 3, the direct product of the automorphism groups of graphs whose edges are colored using k colors, is itself the automorphism group of a graph whose edges are colored using k colors. We have handled the ca

An Algorithm for Solving the Factorizati
An Algorithm for Solving the Factorization Problem in Permutation Groups
โœ T. Minkwitz ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,