✦ LIBER ✦

On the Complexity of the Isomorphism Relation for Finitely Generated Groups

✍ Scribed by Simon Thomas; Boban Velickovic

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 158 KB
Volume: 217
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1998.7825

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finite groups with the cayley isomorp

On finite groups with the cayley isomorphism property

✍ Li, Cai Heng; Praeger, Cheryl E.; Xu, Ming Yao 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

Let G be a finite group, and let Cay(G, S) be a Cayley digraph of G. If, for all T ⊂ G, Cay(G, S) ∼ = Cay(G, T ) implies S α = T for some α ∈ Aut(G), then Cay(G, S) is called a CI-graph of G. For a group G, if all Cayley digraphs of valency m are CI-graphs, then G is said to have the m-DCI property;

On Finite Groups with the Cayley Isomorp

On Finite Groups with the Cayley Isomorphism Property, II

✍ Cai Heng Li 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 184 KB

For a positive integer m, a group G is said to have the m-DCI property if, for any Cayley digraphs Cay(G, S) and Cay(G, T ) of G of valency m (that is, |S| = |T | =m), Cay(G, S)$Cay(G, T ) if and only if S \_ =T for some \_ # Aut(G). This paper is one of a series of papers towards characterizing fin

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.

On the Isomorphism Problem for Finite Ca

On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency

✍ C.H. Li; C.E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 187 KB

For a subset S of a group G such that 1 / ∈ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 ∈ S. Each σ ∈ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S σ ). For a positive integer m, th

Remarks on the Generation of Orthogonal

Remarks on the Generation of Orthogonal Groups over Finite Fields

✍ A.G. Earnest; R.A. Catalpa; U.S. Schmidt; G.T. Stewart 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 256 KB

On the Number of Generators of Finite Im

On the Number of Generators of Finite Images of Free Products of Finite Groups

✍ Andrea Lucchini 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 108 KB

We prove that the analog of the Grushko-Neumann theorem does not hold for profinite free products of profinite groups. To do that we bound the number of generators of a finite group generated by a family of subgroups of pairwise coprime orders.