Signs in subresultant pseudo-remainder sequence
$begingroup$
Subresultant pseudo-remainder sequence is way of computing remainder sequence of two polynomials in $mathbb{Z}$ and keeping the size of coefficients relatively small, but the signs of the remainders differ from the signs of proper remainders calculated by GCD in $mathbb{Q}$.
It is possible to modify the pseudo-remainder sequence so that the signs coincide with those of Sturm sequnce.
The above article mentions that it is possible to modify the subresultant pseudo-remainder sequence similarly but does not explain how:
For input polynomials with integers coefficients, this allows retrieval of Sturm sequences consisting of polynomials with integer coefficients. The subresultant pseudo-remainder sequence may be modified similarly, in which case the signs of the remainders coincide with those computed over the rationals.
Please, does anyone know how to modify the subresultant pseudo-remainder sequence so that "the signs of the remainders coincide with those computed over the rationals"? Or perhaps someone is having a link to relevant literature?
polynomials greatest-common-divisor euclidean-algorithm resultant
asked Jan 15 at 22:20
Ecir HanaEcir Hana
449414
$endgroup$
add a comment |
$begingroup$
Subresultant pseudo-remainder sequence is way of computing remainder sequence of two polynomials in $mathbb{Z}$ and keeping the size of coefficients relatively small, but the signs of the remainders differ from the signs of proper remainders calculated by GCD in $mathbb{Q}$.
It is possible to modify the pseudo-remainder sequence so that the signs coincide with those of Sturm sequnce.
The above article mentions that it is possible to modify the subresultant pseudo-remainder sequence similarly but does not explain how:
For input polynomials with integers coefficients, this allows retrieval of Sturm sequences consisting of polynomials with integer coefficients. The subresultant pseudo-remainder sequence may be modified similarly, in which case the signs of the remainders coincide with those computed over the rationals.
Please, does anyone know how to modify the subresultant pseudo-remainder sequence so that "the signs of the remainders coincide with those computed over the rationals"? Or perhaps someone is having a link to relevant literature?
polynomials greatest-common-divisor euclidean-algorithm resultant
asked Jan 15 at 22:20
Ecir HanaEcir Hana
449414
$endgroup$
add a comment |
$begingroup$
Subresultant pseudo-remainder sequence is way of computing remainder sequence of two polynomials in $mathbb{Z}$ and keeping the size of coefficients relatively small, but the signs of the remainders differ from the signs of proper remainders calculated by GCD in $mathbb{Q}$.
It is possible to modify the pseudo-remainder sequence so that the signs coincide with those of Sturm sequnce.
The above article mentions that it is possible to modify the subresultant pseudo-remainder sequence similarly but does not explain how:
For input polynomials with integers coefficients, this allows retrieval of Sturm sequences consisting of polynomials with integer coefficients. The subresultant pseudo-remainder sequence may be modified similarly, in which case the signs of the remainders coincide with those computed over the rationals.
Please, does anyone know how to modify the subresultant pseudo-remainder sequence so that "the signs of the remainders coincide with those computed over the rationals"? Or perhaps someone is having a link to relevant literature?
polynomials greatest-common-divisor euclidean-algorithm resultant
asked Jan 15 at 22:20
Ecir HanaEcir Hana
449414
$endgroup$
Subresultant pseudo-remainder sequence is way of computing remainder sequence of two polynomials in $mathbb{Z}$ and keeping the size of coefficients relatively small, but the signs of the remainders differ from the signs of proper remainders calculated by GCD in $mathbb{Q}$.
It is possible to modify the pseudo-remainder sequence so that the signs coincide with those of Sturm sequnce.
The above article mentions that it is possible to modify the subresultant pseudo-remainder sequence similarly but does not explain how:
For input polynomials with integers coefficients, this allows retrieval of Sturm sequences consisting of polynomials with integer coefficients. The subresultant pseudo-remainder sequence may be modified similarly, in which case the signs of the remainders coincide with those computed over the rationals.
Please, does anyone know how to modify the subresultant pseudo-remainder sequence so that "the signs of the remainders coincide with those computed over the rationals"? Or perhaps someone is having a link to relevant literature?
polynomials greatest-common-divisor euclidean-algorithm resultant
polynomials greatest-common-divisor euclidean-algorithm resultant
asked Jan 15 at 22:20
Ecir HanaEcir Hana
449414
asked Jan 15 at 22:20
Ecir HanaEcir Hana
449414
asked Jan 15 at 22:20
Ecir HanaEcir Hana
449414
asked Jan 15 at 22:20
Ecir HanaEcir Hana
449414
asked Jan 15 at 22:20
Ecir HanaEcir Hana
449414
449414
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
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%2f3075050%2fsigns-in-subresultant-pseudo-remainder-sequence%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%2f3075050%2fsigns-in-subresultant-pseudo-remainder-sequence%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
