User w edwin clark - MathOverflowmost recent 30 from http://mathoverflow.net2013-05-20T17:46:11Zhttp://mathoverflow.net/feeds/user/27704http://www.creativecommons.org/licenses/by-nc/2.5/rdfhttp://mathoverflow.net/questions/118494/largest-permutation-group-without-2-cycles-or-3-cycles/118919#118919Answer by W Edwin Clark for Largest permutation group without 2-cycles or 3-cyclesW Edwin Clark2013-01-14T20:24:54Z2013-01-14T20:24:54Z<p>Two sequences motivated by this question made with a brute force GAP program:</p>
<p><a href="https://oeis.org/A208232" rel="nofollow">https://oeis.org/A208232</a> and
<a href="https://oeis.org/A208235" rel="nofollow">https://oeis.org/A208235</a></p>
<p>Someone may like to extend these sequences.</p>
http://mathoverflow.net/questions/107298/realizable-order-sequences-for-finite-groups/111102#111102Answer by W Edwin Clark for Realizable Order Sequences for Finite GroupsW Edwin Clark2012-11-01T03:36:02Z2012-11-01T03:36:02Z<p>At least for finite abelian groups the problem has been solved. See</p>
<p>Isomorphism of Finite Abelian Groups,
by Ronald McHaffey, The American Mathematical Monthly, Vol. 72, No. 1 (Jan., 1965), pp. 48-50, Stable URL: <a href="http://www.jstor.org/stable/2313001" rel="nofollow">http://www.jstor.org/stable/2313001</a></p>
<p>The author essentially proves that if the sequence of orders of two finite abelian groups are the same then the groups are isomorphic. </p>