Simple groups of the same order
I heard that there are no 3 nonisomorphic simple groups of the same order.
Question: Is there an elementary proof of this?
In case this is not the case, here a modified question:
Question: Is there an elementary proof that there are not $m$ nonisomorphic simple groups of the same order with $m geq 4$ as small as possible?
gr.group-theory finite-groups
edited Dec 7 at 15:57
Jim Humphreys
41.4k491188
asked Dec 7 at 14:53
Mare
3,55021231
add a comment |
I heard that there are no 3 nonisomorphic simple groups of the same order.
Question: Is there an elementary proof of this?
In case this is not the case, here a modified question:
Question: Is there an elementary proof that there are not $m$ nonisomorphic simple groups of the same order with $m geq 4$ as small as possible?
gr.group-theory finite-groups
edited Dec 7 at 15:57
Jim Humphreys
41.4k491188
asked Dec 7 at 14:53
Mare
3,55021231
A related question: How spread out are the (non-abelian) simple groups in terms of their orders? What are some "near misses"? For example, 168-60 is already quite small. Are there smaller differences, perhaps scaling to account for size?
– David Richter
Dec 7 at 17:17
add a comment |
I heard that there are no 3 nonisomorphic simple groups of the same order.
Question: Is there an elementary proof of this?
In case this is not the case, here a modified question:
Question: Is there an elementary proof that there are not $m$ nonisomorphic simple groups of the same order with $m geq 4$ as small as possible?
gr.group-theory finite-groups
edited Dec 7 at 15:57
Jim Humphreys
41.4k491188
asked Dec 7 at 14:53
Mare
3,55021231
I heard that there are no 3 nonisomorphic simple groups of the same order.
Question: Is there an elementary proof of this?
In case this is not the case, here a modified question:
Question: Is there an elementary proof that there are not $m$ nonisomorphic simple groups of the same order with $m geq 4$ as small as possible?
gr.group-theory finite-groups
gr.group-theory finite-groups
edited Dec 7 at 15:57
Jim Humphreys
41.4k491188
asked Dec 7 at 14:53
Mare
3,55021231
edited Dec 7 at 15:57
Jim Humphreys
41.4k491188
asked Dec 7 at 14:53
Mare
3,55021231
edited Dec 7 at 15:57
Jim Humphreys
41.4k491188
edited Dec 7 at 15:57
Jim Humphreys
41.4k491188
edited Dec 7 at 15:57
Jim Humphreys
41.4k491188
41.4k491188
asked Dec 7 at 14:53
Mare
3,55021231
asked Dec 7 at 14:53
Mare
3,55021231
asked Dec 7 at 14:53
Mare
3,55021231
3,55021231
A related question: How spread out are the (non-abelian) simple groups in terms of their orders? What are some "near misses"? For example, 168-60 is already quite small. Are there smaller differences, perhaps scaling to account for size?
– David Richter
Dec 7 at 17:17
add a comment |
A related question: How spread out are the (non-abelian) simple groups in terms of their orders? What are some "near misses"? For example, 168-60 is already quite small. Are there smaller differences, perhaps scaling to account for size?
– David Richter
Dec 7 at 17:17
A related question: How spread out are the (non-abelian) simple groups in terms of their orders? What are some "near misses"? For example, 168-60 is already quite small. Are there smaller differences, perhaps scaling to account for size?
– David Richter
Dec 7 at 17:17
A related question: How spread out are the (non-abelian) simple groups in terms of their orders? What are some "near misses"? For example, 168-60 is already quite small. Are there smaller differences, perhaps scaling to account for size?
– David Richter
Dec 7 at 17:17
add a comment |
1 Answer
1
active
oldest
votes
No, there are no known proofs of any results of this type that do not rely on the complete classification of finite simple groups
In particular, the result of Pyber (1993) giving an upper bound on the number of isomorphism classes of finite groups of order $n$ (see Jack Schmidt's answer to this question for details) could only be incorrect if there were vast numbers of isomorphism classes of simple groups of the same order, but it still relies on the classification.
edited Dec 7 at 15:54
Jim Humphreys
41.4k491188
answered Dec 7 at 15:09
Derek Holt
26.4k461108
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "504"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f317126%2fsimple-groups-of-the-same-order%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
No, there are no known proofs of any results of this type that do not rely on the complete classification of finite simple groups
In particular, the result of Pyber (1993) giving an upper bound on the number of isomorphism classes of finite groups of order $n$ (see Jack Schmidt's answer to this question for details) could only be incorrect if there were vast numbers of isomorphism classes of simple groups of the same order, but it still relies on the classification.
edited Dec 7 at 15:54
Jim Humphreys
41.4k491188
answered Dec 7 at 15:09
Derek Holt
26.4k461108
add a comment |
No, there are no known proofs of any results of this type that do not rely on the complete classification of finite simple groups
In particular, the result of Pyber (1993) giving an upper bound on the number of isomorphism classes of finite groups of order $n$ (see Jack Schmidt's answer to this question for details) could only be incorrect if there were vast numbers of isomorphism classes of simple groups of the same order, but it still relies on the classification.
edited Dec 7 at 15:54
Jim Humphreys
41.4k491188
answered Dec 7 at 15:09
Derek Holt
26.4k461108
add a comment |
No, there are no known proofs of any results of this type that do not rely on the complete classification of finite simple groups
In particular, the result of Pyber (1993) giving an upper bound on the number of isomorphism classes of finite groups of order $n$ (see Jack Schmidt's answer to this question for details) could only be incorrect if there were vast numbers of isomorphism classes of simple groups of the same order, but it still relies on the classification.
edited Dec 7 at 15:54
Jim Humphreys
41.4k491188
answered Dec 7 at 15:09
Derek Holt
26.4k461108
No, there are no known proofs of any results of this type that do not rely on the complete classification of finite simple groups
In particular, the result of Pyber (1993) giving an upper bound on the number of isomorphism classes of finite groups of order $n$ (see Jack Schmidt's answer to this question for details) could only be incorrect if there were vast numbers of isomorphism classes of simple groups of the same order, but it still relies on the classification.
edited Dec 7 at 15:54
Jim Humphreys
41.4k491188
answered Dec 7 at 15:09
Derek Holt
26.4k461108
edited Dec 7 at 15:54
Jim Humphreys
41.4k491188
edited Dec 7 at 15:54
Jim Humphreys
41.4k491188
edited Dec 7 at 15:54
Jim Humphreys
41.4k491188
41.4k491188
answered Dec 7 at 15:09
Derek Holt
26.4k461108
answered Dec 7 at 15:09
Derek Holt
26.4k461108
answered Dec 7 at 15:09
Derek Holt
26.4k461108
26.4k461108
add a comment |
add a comment |
Thanks for contributing an answer to MathOverflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f317126%2fsimple-groups-of-the-same-order%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
A related question: How spread out are the (non-abelian) simple groups in terms of their orders? What are some "near misses"? For example, 168-60 is already quite small. Are there smaller differences, perhaps scaling to account for size?
– David Richter
Dec 7 at 17:17