# An Annoying Open Problem

* How do we tell if two groups are isomorphic? *

Vikraman Arvind and Jacobo Torán are both complexity theorists, both with wide interests, but both who have worked extensively on the graph isomorphism problem. See their survey here, for example.

Today I want to talk about about an open problem, and their paper on the problem, which makes some progress. But the problem is still open—I find this an embarrassment—we should be able to solve this problem.

The problem is: Given two groups defined by tables, are they isomorphic? This is the – problem. What is annoyingly open is whether this problem belongs to , or alternatively, whether it is equivalent to Graph Isomorphism.

A Cayley table, after the 19th century British mathematician Arthur Cayley, is just the table of the multiplication function

There are many ways to represent a finite group. The above is natural: just give the multiplication table. There are many others: we could give the group as a “black box,” as a set of generators and relationships, or as a set of matrices. It should be clear that the easiest representation to deal with must be Cayley tables. Many questions that are hard in other representations are easy, even simple, in this representation. Note that this representation is larger than the size of the group itself, basically its square. The other representations, by contrast, are more *succinct*.

** The Problem **

The precise definition of the – problem is: given two tables that define the groups and , are they isomorphic? That is, is there a bijective mapping from the elements of to the elements of , say , so that for all in :

This is a fancy way of saying that except for the names of the elements the groups are the same.

** The Short History **

I find this problem very annoying. I have spent uncountable hours working on this over the last decades, especially jointly with Zeke Zalcstein. One reason the problem is so annoying is that it is easy to prove that it can be reduced to Graph Isomorphism (). But surely the additional structure of groups must help make the problem much easier to solve. Here are some encouraging differences between groups and graphs:

- Every subset of elements of a graph is a graph; only certain subsets of elements of a group form a group.
- Groups have a tight structure that varies with the prime factorization of , the number of elements. For instance, if is a prime there is exactly one group—the cyclic group .
- Groups always have automorphisms, provided . Graphs can have many automorphisms—for instance the complete graph has —or they can have as little as no nontrivial automorphisms.
- I could go on and on with the many structural differences.

Yet for all these differences, the best Zeke and I could do was prove, in 1976, that – can be solved in space . Bob Tarjan independently noticed at the same time that it could be done in time. Both results are really the same: they both exploit the fact that a group of elements always has a generating set of size . This is a direct consequence of Lagrange’s Theorem, as follows:

Let be a group with elements. Let the trivial group that contains only the identity element of . If is all of , then stop and we have found generators. If is not add any element of that is not in . By Lagrange’s Theorem this must have at least twice as many elements as : call it . The last point is key: let have elements and have elements. Clearly . But , which implies that .

** Complexity Approach **

One of the success stories of complexity theory, and potentially a great story, is its application to solve the – question—almost. The well-known Merlin-Arthur protocol for graph isomorphism works also for group isomorphism—see here and here for details.

What Arvind and Torán prove is that at least for a large class of groups, namely the *solvable* groups, the – problem is almost in . Namely, there is an -machine for the complement of this language that works correctly on all but a quasi-polynomial number of inputs of length . This may not sound very impressive, but it is. By the famous Feit-Thompson theorem, all groups of odd order are solvable. Note that solvable groups play an important role in others ways in complexity theory, which I have discussed a number of times before.

What they actually first show is that the complementary task, ––, has an Arthur-Merlin protocol in which Arthur uses only random bits and Merlin uses only nondeterminism. This makes various kinds of de-randomization easier to apply. The existence of a language in that is *bi-immune* to polynomial space, i.e. the assumption , suffices to de-randomize this completely and thus put – into .

** The Group Approach **

Recall that groups come in various types: there are simpsle groups, there are solvable groups, there are abelian groups, and more. One type of groups that are very important are called –*groups*. A group is a -group if the order of the group—the number of elements in the group—is where is a prime and . Every such group is solvable.

One of the outstanding issues in group theory is that there is no general structure theorem for -groups. They are very complex, and even understanding the structure of all such groups of size for modest values of is non-trivial.

The groups of order for were classified early in the history of group theory, and modern work has extended these classifications to groups whose order divides . According to our friends at Wikepedia–see here:

the sheer number of families of such groups grows so quickly that further classifications along these lines are judged difficult for the human mind to comprehend.

The number of different, non-isomorphic, -groups is exponential:

As a complexity theorist I would disagree a bit with the idea that *many implies hard to understand*. There are many boolean strings of length , but they are not that hard to understand in some sense. What makes -groups hard, is that they can have complex structure, and we do not understand it, at all.

Zeke and I worked hard trying to understand these groups enough so that we could get a better isomorphism algorithm. We never made any progress. I would be excited if we could even prove there is an algorithm that runs in

for -groups.

** Open Problems **

Please solve the – problem. Or at least break below the time, which is the best known now for decades. Can you prove

for some ? Good hunting.

How about a simpler definition of the problem to enable people which are not mathematically lyric to solve the problem?

greetings

> This is a fancy way of saying that except for the names of the elements the groups are the same.

I am not in a position to argue, but isn’t it true only if the group operation (multiplication in your example) are the same?

Yes– it follows from the mapping (pi).

It might be possible to make precise the idea that it’s not the vast number of p-groups that makes the problem hard. A result of Sims (based on earlier work of Higman) shows that most p-groups are of a very specific form (3-step nilpotent). If you had an algorithm that distinguished these 3-step nilpotent p-groups from each other, then that would make it clear that it’s not the vast number that’s the problem.

(In fact, the same sort of result saying that the generic situation is 3-step nilpotent holds for several different algebraic structures, see the beginning of Section 10 of this paper of Bjorn Poonen’s, which is also where I heard about the Sims-Higman result.)

The URL got stripped, the paper of Poonen’s is arXiv:math/0608491

An actual URL, to simplify things: http://arxiv.org/abs/math/0608491

I was enjoying this post until I got to the end and saw this annoying advert: imgur.com/mb8aX

This problem seems like an ideal candidate for a polymath project. The problem is both easy to describe and easy to understand.

Interesting idea. My current view about polymath projects is that whether or not they actually solve the problems they set out to solve, they almost automatically lead very quickly to an incredibly thorough understanding of those problems. This question is, as you say, very easy to state, so it is highly plausible that a polymathematical conversation would at least get quickly to the heart of the difficulty.

Tim Gowers,

I agree. Perhaps we should discuss doing this.

Is graph isomorphism known to be in P or not in P?

Scottie Barbarossa,

Sorry. It is open. The best result is that bounded degree graphs are in P. But the general case is wide open.

Prof. Lipton,

It might help if you could provide an example or two for two non-isomorphic groups.

Thanks,

See http://en.wikipedia.org/wiki/List_of_small_groups

Two non-isomorphic groups are e.g.

the cyclic group of order 4, Z_4, and the Klein four-group, V_4,

they have the following multiplication tables.

Z_4 = [[1,a,b,c],[a,b,c,1],[b,c,1,a],[c,1,a,b]]

V_4 = [[1,a,b,c],[a,1,c,b],[b,c,1,a],[c,b,a,1]]

You might call this a far fetched hunch…

There is possibility that there might be common paradigm (or a theory) that is holding the secret to the solution of such seemingly easy as well as NP-hard problems including #P-complete problems (of course in P-time).

Nice post. By gradually stripping off the group axioms, is there a known point at which the problem becomes equivalent to graph isomorphism? For instance, what if we consider semigroup isomorphism? What is known about algebra isomorphism (for general algebras, with operations presented as tables) in general?

Hi,

sorry for asking such a probably naive question but:

We are limiting the problem to finite groups, are we?

warmest regards

Leo

PS: Thanks for the great post, which is understandable for a beginning maths student as myself, and still stays as interesing.

Lenoid

Yes this is for finite groups

Please excuse my naivete, but knowing whether two permutation groups are isomorphic is known to be in P, is it not? By constructing a strong generating set for the two permutation groups in question, then making sure that each generator in the first can be written in terms of the second’s and vice verse?

Am I mistaken in thinking this would imply isomorphism? Why doesn’t this apply to the Cayley table representation?

No. That is not know to be in P to my knowledge. Groups can have many different generator sets. So you would have to cycle through all possible ones to be sure that not isomorphic. That is the whole point of the $latex n^{log_2 n} bound that is known. In permutation form it is even harder, since the groups can be huge.

Now I am very confused. I hope you’ll indulge me to see where the flaw in my logic is.

I was under the impression that finding a strong generating set was polynomial in time in the number of generating set given. I was also under the impression that given a strong generating set, member inclusion was also polynomial time. Given two permutation groups, $G$ and $H$ given by their strong generating sets $$ and $$ respectively, one can test for member inclusion. i.e. test that every $h_k$ can be written in terms of $$ which would prove that $H \le G$. By then showing that every $g_k$ can be rewritten in terms of $$ one can then show that $G \le H$, proving isomorphism.

Am I to understand that either there is a flaw in my above logic, finding strong generating sets is not polynomial time solvable or that member inclusion is not polynomial time solvable?

anonymous,

The issue is that the groups are permuting the elements with the labels 1,…,n. Each can have a different view what the labels mean. Consider two cyclic groups. One could permute 1 to 2 to … to n to 1; while the other could permute 11 to 31 to 15 to … 188 to 11. These are the same groups—both are cyclic on n elements—but they “look” very different. No? Of course for this case of cyclic it is easy, but for general groups it is really hard.

If you need crazy idea, there is one, don’t know how far one can go with it. I was looking for tables of simple groups (http://www.math.niu.edu/~beachy/aaol/grouptables1.html). One can look at all 2×2 minors ( entries) and create the structure like this: for both groups. Lets ignore for a moment left bracket. Right bracket encodes multiplication table up to renaming, therefore, if one can find correspondence between right brackets for 2 groups, and find consistent assignment for the left brackets the groups are isomorphic. Right brackets have different multiplicity, so one can reduce representation to the list , possibly up to local 2×2 permutations. If two groups are isomorphic 1) the multiplicities should coincide, 2) the structure of the left brackets should also coincide. Now we working with left brackets in multiplicity representation (so there is only one such line for each distinct right bracket, and looking for small groups, it seems that subgroups will be connected, and we need to look only at entries with identity elements entering twice on the right site bracket). So the connectedness of the elements in the left brackets show the structure of the group. Now one need to check the consistency of corresponding groups.

I am curious as to opinion on whether the Cayley table is really the best way to represent a group. If one translates the group into a Cayley graph, and the develops the appropriate distance table, then one gets a more “dynamic” representation of the group.

http://thefurloff.com/2014/02/23/100th-post-discrete-logs-and-cayley-graphs/

The paper by Fabian Wagner http://dl.acm.org/citation.cfm?id=2805607&CFID=920425961&CFTOKEN=16261980 purports to break the n^log n barrier for p-groups — Glen Whitney