On the distance between non-isomorphic groups

Authors:
Gábor Ivanyos;François Le Gall;Yuichi Yoshida
Affiliations:
Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u.13-17, H-1111 Budapest, Hungary;Department of Computer Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656, Japan;School of Informatics, Kyoto University, and Preferred Infrastructure, Inc., Yoshida-Honmachi, Kyoto 606-8501, Japan
Venue:
European Journal of Combinatorics
Year:
2012

Citing 4
Cited 1

How far apart can the group multiplication tables be?

European Journal of Combinatorics
Non-isomorphic 2-groups coincide at most in three quarters of their multiplication tables

European Journal of Combinatorics
Non-Abelian homomorphism testing, and distributions close to their self-convolutions

Random Structures & Algorithms
Linearity testing in characteristic two

IEEE Transactions on Information Theory - Part 1

Property testing for cyclic groups and beyond

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A result of Ben-Or, Coppersmith, Luby and Rubinfeld on testing whether a map between two groups is close to a homomorphism implies a tight lower bound on the distance between the multiplication tables of two non-isomorphic groups.