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

A counterexample for the isomorphism-problem of polycyclic groups

โœ Scribed by Klaus W. Roggenkamp; Alexander Zimmermann

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
157 KB
Volume
103
Category
Article
ISSN
0022-4049

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the isomorphism problem for just-infi
On the isomorphism problem for just-infinite groups
โœ Robert C. Brigham ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 414 KB

The work for this paper was carried out partly at the Courant Institute of Mathematical Sciences under NSF Grant GP-12024. Reproduction in whole or in part is permitted for any purpose of the United States Government. Communicated through G. Baumslag.

The isomorphism problem for Cayley digra
The isomorphism problem for Cayley digraphs on groups of prime-squared order
โœ Anne Joseph ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 514 KB

Given any prime p, there are two non-isomorphic groups of order p2. We determine precisely when a Cayley digraph on one of these groups is isomorphic to a Cayley digraph on the other group, Namely, let X = Cay(G: T) be a Cayley digraph on a group G of order p2 with generating set T. We prove that X

On the isomorphism problem for a family
On the isomorphism problem for a family of cubic metacirculant graphs
โœ Ngo Dac Tan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 589 KB

In this paper an isomorphism testing algorithm for graphs in the family of all cubic metacirculant graphs with non-empty first symbol So is given. The time complexity of this algorithm is also evaluated.