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

On the isomorphisms and automorphism groups of circulants

โœ Scribed by Qiongxiang Huang; Jixiang Meng

Publisher
Springer Japan
Year
1996
Tongue
English
Weight
536 KB
Volume
12
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Automorphism group computation and isomo
Automorphism group computation and isomorphism testing in finite groups
โœ John J. Cannon; Derek F. Holt ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 282 KB

A new method for computing the automorphism group of a finite permutation group and for testing two such groups for isomorphism is described. Some performance statistics are included for an implementation of these algorithms in the Magma language.

The Automorphism Groups of Minimal Infin
The Automorphism Groups of Minimal Infinite Circulant Digraphs
โœ Jixiang Meng; Huang Qiongxing ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

An infinite circulant digraph is a Cayley digraph of the cyclic group of Z of integers . Here we prove that the full automorphism group of any strongly connected infinite circulant digraph over minimal generating set is just the group of translations of Z . We also present some related conjectures .