Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

As we read from wiki, informally, the reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs.

  1. Is there a group-theoretic formulation of this conjecture?
  2. Has an analogous conjecture been made in group theory(in any sensible way)?

References such as books will do, thanks.

share|improve this question
    
Re: 1. Do you have a reason for thinking that there might be a group-theoretic formulation? –  HJRW Aug 8 '10 at 11:46
1  
Maybe, he is asking whether there is an algebraic attack as there has been many in algebraic graph theory using group theory. And as his previous question on intersections suggests:mathoverflow.net/questions/33366/… , he has a bias towards an object-subobject relation. –  Unknown Aug 8 '10 at 12:02
    
@Elohemahab, as I understand, you are seeking a way by which the following can be made precise "groups are determined uniquely by their subgroups...." –  Unknown Aug 8 '10 at 12:07
4  
You can find two groups of order 16 whose lattices of subgroups are isomorphic. This suggests you may have to look at finer structure. –  S. Carnahan Aug 8 '10 at 15:00
    
I don't think anything analogous can hold for groups, because graphs are far more general. There's no notion of index of a subgraph in a graph, for example. Intuitively, the set of all subgraphs of a graph tells you much more than the set of all subgroups of a group (as Scott suggested). –  Eric Tressler Aug 8 '10 at 18:27
show 5 more comments

1 Answer 1

up vote 3 down vote accepted

There are continuum 2-generated groups where all proper subgroups are cyclic of order $p$ (for the same prime $p\sim 10^{70}$), the Tarski monsters. All these groups have the same lists of proper subgroups, and the same lattice of subgroups. Also all cyclic groups of prime order have the same proper subgroups: the trivial group. So in general the answer is "no". But every finite non-cyclic abelian group is determined by the list of its proper subgroups, which follows easily from the description of finite abelian groups (note that I and, I think, the question, are not talking about the lattice of subgroups, but about the list of all proper subgroups). I suspect that at least for a large class of finite solvable groups, the list of proper subgroups determines the group. I would look first at A-groups, finite groups with all Sylow subgroups abelian (see the book of Huppert, "Endliche Gruppen") because the structure of subgroups of A-groups is more known, and one can use induction on the order of the group.

share|improve this answer
    
Nice explanation. That makes the formulation of such conjectures for groups as remote as can be. I think question (1) remains. –  Unknown Feb 6 '11 at 0:36
    
Am I right that you want a group theoretic statement that is equivalent to the statement about graphs? With every graph $\Gamma$, associate a group (called Right Angled Artin group) $R(\Gamma)$ it is generated by the vertices of $\Gamma$ subject to the relations $ab=ba$ iff $a$ is adjacent to $b$. Every induced subgraph of $\Gamma$ gives a subgroup of $R(\Gamma)$. If $\Gamma$ is finite, one can use a finite nilpotent quotient of $R(\Gamma)$. –  Mark Sapir Feb 6 '11 at 1:54
    
@Mark, yes. I want a group theoretic statement that is equivalent to the statement about graphs. –  Unknown Feb 27 '11 at 22:50
    
@Elohemahab: The following is probably true: the group $R(\Gamma)$ is defined uniquely by its subgroups iff $\Gamma$ is defined by its subgraphs. –  Mark Sapir Feb 27 '11 at 23:19
    
@Mark, much obliged. I will accept this answer for the above comment. It is plausible. –  Unknown Mar 2 '11 at 19:01
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.