Determining Maximal Orders of a Quaternion Algebra
$begingroup$
Let $F=left(frac{a,b}{K}right)$ be a quaternion algebra for some number field $K$. What method do we use to determine a maximal order of $F$ (or the class of maximal orders of $F$)?
number-theory algebraic-number-theory quaternions
$endgroup$
add a comment |
$begingroup$
Let $F=left(frac{a,b}{K}right)$ be a quaternion algebra for some number field $K$. What method do we use to determine a maximal order of $F$ (or the class of maximal orders of $F$)?
number-theory algebraic-number-theory quaternions
$endgroup$
$begingroup$
Ivanyos and Rónyai have published an algorithm for handling this task. IIRC it is implemented in at least MAGMA. I do recall that implementation running out of mem when we tried to use it on a large cyclic algebra. We managed to use the ideas and known special facts about our case to find a maximal order. I'm afraid the details have mostly faded from my mind even though I was in charge of that part of our joint paper.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:03
$begingroup$
The idea was to build orders mapping a suitable lattice to itself. I & R had a useful way of alternately increasing the lattice and the related order alternately, but I don't remember any of the details.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:08
add a comment |
$begingroup$
Let $F=left(frac{a,b}{K}right)$ be a quaternion algebra for some number field $K$. What method do we use to determine a maximal order of $F$ (or the class of maximal orders of $F$)?
number-theory algebraic-number-theory quaternions
$endgroup$
Let $F=left(frac{a,b}{K}right)$ be a quaternion algebra for some number field $K$. What method do we use to determine a maximal order of $F$ (or the class of maximal orders of $F$)?
number-theory algebraic-number-theory quaternions
number-theory algebraic-number-theory quaternions
asked Nov 30 '18 at 17:50
ChrisChris
332112
332112
$begingroup$
Ivanyos and Rónyai have published an algorithm for handling this task. IIRC it is implemented in at least MAGMA. I do recall that implementation running out of mem when we tried to use it on a large cyclic algebra. We managed to use the ideas and known special facts about our case to find a maximal order. I'm afraid the details have mostly faded from my mind even though I was in charge of that part of our joint paper.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:03
$begingroup$
The idea was to build orders mapping a suitable lattice to itself. I & R had a useful way of alternately increasing the lattice and the related order alternately, but I don't remember any of the details.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:08
add a comment |
$begingroup$
Ivanyos and Rónyai have published an algorithm for handling this task. IIRC it is implemented in at least MAGMA. I do recall that implementation running out of mem when we tried to use it on a large cyclic algebra. We managed to use the ideas and known special facts about our case to find a maximal order. I'm afraid the details have mostly faded from my mind even though I was in charge of that part of our joint paper.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:03
$begingroup$
The idea was to build orders mapping a suitable lattice to itself. I & R had a useful way of alternately increasing the lattice and the related order alternately, but I don't remember any of the details.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:08
$begingroup$
Ivanyos and Rónyai have published an algorithm for handling this task. IIRC it is implemented in at least MAGMA. I do recall that implementation running out of mem when we tried to use it on a large cyclic algebra. We managed to use the ideas and known special facts about our case to find a maximal order. I'm afraid the details have mostly faded from my mind even though I was in charge of that part of our joint paper.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:03
$begingroup$
Ivanyos and Rónyai have published an algorithm for handling this task. IIRC it is implemented in at least MAGMA. I do recall that implementation running out of mem when we tried to use it on a large cyclic algebra. We managed to use the ideas and known special facts about our case to find a maximal order. I'm afraid the details have mostly faded from my mind even though I was in charge of that part of our joint paper.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:03
$begingroup$
The idea was to build orders mapping a suitable lattice to itself. I & R had a useful way of alternately increasing the lattice and the related order alternately, but I don't remember any of the details.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:08
$begingroup$
The idea was to build orders mapping a suitable lattice to itself. I & R had a useful way of alternately increasing the lattice and the related order alternately, but I don't remember any of the details.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:08
add a comment |
0
active
oldest
votes
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: "69"
};
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%2fmath.stackexchange.com%2fquestions%2f3020396%2fdetermining-maximal-orders-of-a-quaternion-algebra%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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.
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%2fmath.stackexchange.com%2fquestions%2f3020396%2fdetermining-maximal-orders-of-a-quaternion-algebra%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
$begingroup$
Ivanyos and Rónyai have published an algorithm for handling this task. IIRC it is implemented in at least MAGMA. I do recall that implementation running out of mem when we tried to use it on a large cyclic algebra. We managed to use the ideas and known special facts about our case to find a maximal order. I'm afraid the details have mostly faded from my mind even though I was in charge of that part of our joint paper.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:03
$begingroup$
The idea was to build orders mapping a suitable lattice to itself. I & R had a useful way of alternately increasing the lattice and the related order alternately, but I don't remember any of the details.
$endgroup$
– Jyrki Lahtonen
Dec 1 '18 at 18:08