Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board Member: Blackburn, Simon R. / Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Schäge, Sven / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year


CiteScore 2016: 0.35

SCImago Journal Rank (SJR) 2016: 0.372
Source Normalized Impact per Paper (SNIP) 2016: 0.517

Mathematical Citation Quotient (MCQ) 2016: 0.23

Online
ISSN
1869-6104
See all formats and pricing
More options …

Isomorphism in expanding families of indistinguishable groups

Mark L. Lewis / James B. Wilson
Published Online: 2012-05-01 | DOI: https://doi.org/10.1515/gcc-2012-0008

Abstract.

For every odd prime and every integer , there is a Heisenberg group of order that has pairwise nonisomorphic quotients of order . Yet, these quotients are virtually indistinguishable. They have isomorphic character tables, every conjugacy class of a non-central element has the same size, and every element has order at most . They are also directly and centrally indecomposable and of the same indecomposability type. Nevertheless, there is a polynomial-time algorithm to test for isomorphisms between these groups.

Keywords: -group; group isomorphism; polynomial-time; asymptotic group theory

About the article

Received: 2010-10-27

Published Online: 2012-05-01

Published in Print: 2012-05-01


Citation Information: Groups - Complexity - Cryptology, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc-2012-0008.

Export Citation

© 2012 by Walter de Gruyter Berlin Boston. Copyright Clearance Center

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

[1]
Liguo He and Mark L. Lewis
Communications in Algebra, 2015, Volume 43, Number 11, Page 4916
[2]
Joshua A. Grochow and Youming Qiao
SIAM Journal on Computing, 2017, Volume 46, Number 4, Page 1153
[3]
Peter A. Brooksbank, Joshua Maglione, and James B. Wilson
Journal of Algebra, 2017, Volume 473, Page 545
[4]
James B. Wilson
Communications in Algebra, 2017, Volume 45, Number 4, Page 1452
[5]
S. Mohsen Ghoraishi
Algebra Colloquium, 2015, Volume 22, Number spec01, Page 969
[6]
David J. Rosenbaum and Fabian Wagner
Theoretical Computer Science, 2015, Volume 593, Page 16
[7]
Peter A. Brooksbank and James B. Wilson
Journal of Pure and Applied Algebra, 2014, Volume 218, Number 3, Page 405

Comments (0)

Please log in or register to comment.
Log in