Primary decomposition of large ideals
$begingroup$
Short version:
I'd like to do a primary decomposition of an ideal with 38 generators in a polynomial ring with 44 generators. However, the ideal seems far too large to naively decompose in, say, Macaulay2 (suffice to say I let my computer work all night with no result). Does there exist any "tricks" to do such a computation?
More context:
The ideal I'm trying to decompose is this:
I = ideal matrix {{t_2*t_22-t_7*t_27}, {t_4*t_22+t_2*t_23-t_10*t_27-t_7*t_29}, {t_5*t_22+t_2*t_24-t_12*t_27-t_7*t_31}, {t_4*t_23-t_10*t_29}, {t_5*t_24-t_12*t_31}, {t_5*t_72*t_81-t_12*t_67*t_76+t_24*t_68*t_80-t_31*t_66*t_71}, {t_63*t_73-t_70*t_79},
{t_67*t_71-t_72*t_80}, {t_41*t_69*t_81-t_34*t_76*t_78-t_54*t_66*t_5+t_61*t_64*t_68}, {t_64*t_69-t_75*t_78}, {t_66*t_76-t_68*t_81}, {t_4*t_64*t_73-t_10*t_75*t_79+t_23*t_63*t_69-t_29*t_70*t_78}, {t_39*t_73*t_80-t_33*t_71*t_79-t_52*t_67*t_70+t_59*t_63*t_72}, {t_33*t_52-t_39*t_59}, {t_35*t_52+t_33*t_55-t_42*t_59-t_39*t_62}, {t_34*t_54-t_41*t_61},
{t_35*t_54+t_34*t_55-t_42*t_61-t_41*t_62}, {t_35*t_55-t_42*t_62}, {t_2*t_65-t_7*t_74}, {t_4*t_65-t_10*t_74}, {t_5*t_65-t_12*t_74}, {t_27*t_65-t_22*t_74}, {t_29*t_65-t_23*t_74},
{t_31*t_65-t_24*t_74}, {t_33*t_77-t_39*t_82}, {t_34*t_77-t_41*t_82}, {t_35*t_77-t_42*t_82}, {t_59*t_77-t_52*t_82}, {t_61*t_77-t_54*t_82}, {t_62*t_77-t_55*t_82}, {t_64*t_74-t_75*t_77},
{t_63*t_65-t_70*t_77}, {t_69*t_77-t_74*t_78}, {t_73*t_77-t_65*t_79}, {t_65*t_67-t_72*t_82}, {t_65*t_80-t_71*t_82}, {t_66*t_74-t_68*t_82}, {t_74*t_81-t_76*t_82}}
(not all the $t_i$ variables are used, that's why I claim the ring has 44, not 82 generators). Note that most of the generators are binomials - and there exists effective (or at least, more effective) algorithms for decomposing binomial ideals. Is this possible to use somehow?
So how did this ideal come about? Well, it all started with a triangulated simplicial 3-sphere, which give rise to a monomial ideal. (Specifially, $x_1cdots x_n$ is in the ideal iff $x_1cdots x_n$ is not a face of the sphere) Then we try to perturb this ideal and look at the deformation space.
Now, there are results saying that smoothings (in the sense of deformation theory) of the sphere give rise to interesting varieties, for example Calabi-Yau varieties. In my case, we know there's a deformation to the Grassmannian $G(3,6)$. Anyways - I used a Macaulay2 package by Nathan Ilten to start computing the deformation space. The large ideal above consists of the initial terms of the generators of this space (so I guess this is in some sense the tangent space).
What I'm looking for is a yes/no-answer whether this is a feasible task, and if so, what strategies I may use.
algebraic-geometry commutative-algebra ideals macaulay2
$endgroup$
add a comment |
$begingroup$
Short version:
I'd like to do a primary decomposition of an ideal with 38 generators in a polynomial ring with 44 generators. However, the ideal seems far too large to naively decompose in, say, Macaulay2 (suffice to say I let my computer work all night with no result). Does there exist any "tricks" to do such a computation?
More context:
The ideal I'm trying to decompose is this:
I = ideal matrix {{t_2*t_22-t_7*t_27}, {t_4*t_22+t_2*t_23-t_10*t_27-t_7*t_29}, {t_5*t_22+t_2*t_24-t_12*t_27-t_7*t_31}, {t_4*t_23-t_10*t_29}, {t_5*t_24-t_12*t_31}, {t_5*t_72*t_81-t_12*t_67*t_76+t_24*t_68*t_80-t_31*t_66*t_71}, {t_63*t_73-t_70*t_79},
{t_67*t_71-t_72*t_80}, {t_41*t_69*t_81-t_34*t_76*t_78-t_54*t_66*t_5+t_61*t_64*t_68}, {t_64*t_69-t_75*t_78}, {t_66*t_76-t_68*t_81}, {t_4*t_64*t_73-t_10*t_75*t_79+t_23*t_63*t_69-t_29*t_70*t_78}, {t_39*t_73*t_80-t_33*t_71*t_79-t_52*t_67*t_70+t_59*t_63*t_72}, {t_33*t_52-t_39*t_59}, {t_35*t_52+t_33*t_55-t_42*t_59-t_39*t_62}, {t_34*t_54-t_41*t_61},
{t_35*t_54+t_34*t_55-t_42*t_61-t_41*t_62}, {t_35*t_55-t_42*t_62}, {t_2*t_65-t_7*t_74}, {t_4*t_65-t_10*t_74}, {t_5*t_65-t_12*t_74}, {t_27*t_65-t_22*t_74}, {t_29*t_65-t_23*t_74},
{t_31*t_65-t_24*t_74}, {t_33*t_77-t_39*t_82}, {t_34*t_77-t_41*t_82}, {t_35*t_77-t_42*t_82}, {t_59*t_77-t_52*t_82}, {t_61*t_77-t_54*t_82}, {t_62*t_77-t_55*t_82}, {t_64*t_74-t_75*t_77},
{t_63*t_65-t_70*t_77}, {t_69*t_77-t_74*t_78}, {t_73*t_77-t_65*t_79}, {t_65*t_67-t_72*t_82}, {t_65*t_80-t_71*t_82}, {t_66*t_74-t_68*t_82}, {t_74*t_81-t_76*t_82}}
(not all the $t_i$ variables are used, that's why I claim the ring has 44, not 82 generators). Note that most of the generators are binomials - and there exists effective (or at least, more effective) algorithms for decomposing binomial ideals. Is this possible to use somehow?
So how did this ideal come about? Well, it all started with a triangulated simplicial 3-sphere, which give rise to a monomial ideal. (Specifially, $x_1cdots x_n$ is in the ideal iff $x_1cdots x_n$ is not a face of the sphere) Then we try to perturb this ideal and look at the deformation space.
Now, there are results saying that smoothings (in the sense of deformation theory) of the sphere give rise to interesting varieties, for example Calabi-Yau varieties. In my case, we know there's a deformation to the Grassmannian $G(3,6)$. Anyways - I used a Macaulay2 package by Nathan Ilten to start computing the deformation space. The large ideal above consists of the initial terms of the generators of this space (so I guess this is in some sense the tangent space).
What I'm looking for is a yes/no-answer whether this is a feasible task, and if so, what strategies I may use.
algebraic-geometry commutative-algebra ideals macaulay2
$endgroup$
$begingroup$
Naive suggestion: have you tried Sage online? I often found this much quicker than macaulay2, mostly because the code will run on a Sage server instead of your own computer. If that doesn't work then you'll need to be more cunning, but it's something I'd try if you haven't already.
$endgroup$
– mdp
Aug 31 '12 at 11:07
$begingroup$
@MattPressland: Thanks, I hadn't thought of that. Trying it now. Do you have any thoughts on whether I should use Sage's polynomial ring functionality, or use the built-in Macaulay2-interface?
$endgroup$
– Fredrik Meyer
Aug 31 '12 at 12:52
$begingroup$
When I did these kinds of calculations I used the Sage functions, but I don't know whether this is better or worse.
$endgroup$
– mdp
Aug 31 '12 at 12:57
add a comment |
$begingroup$
Short version:
I'd like to do a primary decomposition of an ideal with 38 generators in a polynomial ring with 44 generators. However, the ideal seems far too large to naively decompose in, say, Macaulay2 (suffice to say I let my computer work all night with no result). Does there exist any "tricks" to do such a computation?
More context:
The ideal I'm trying to decompose is this:
I = ideal matrix {{t_2*t_22-t_7*t_27}, {t_4*t_22+t_2*t_23-t_10*t_27-t_7*t_29}, {t_5*t_22+t_2*t_24-t_12*t_27-t_7*t_31}, {t_4*t_23-t_10*t_29}, {t_5*t_24-t_12*t_31}, {t_5*t_72*t_81-t_12*t_67*t_76+t_24*t_68*t_80-t_31*t_66*t_71}, {t_63*t_73-t_70*t_79},
{t_67*t_71-t_72*t_80}, {t_41*t_69*t_81-t_34*t_76*t_78-t_54*t_66*t_5+t_61*t_64*t_68}, {t_64*t_69-t_75*t_78}, {t_66*t_76-t_68*t_81}, {t_4*t_64*t_73-t_10*t_75*t_79+t_23*t_63*t_69-t_29*t_70*t_78}, {t_39*t_73*t_80-t_33*t_71*t_79-t_52*t_67*t_70+t_59*t_63*t_72}, {t_33*t_52-t_39*t_59}, {t_35*t_52+t_33*t_55-t_42*t_59-t_39*t_62}, {t_34*t_54-t_41*t_61},
{t_35*t_54+t_34*t_55-t_42*t_61-t_41*t_62}, {t_35*t_55-t_42*t_62}, {t_2*t_65-t_7*t_74}, {t_4*t_65-t_10*t_74}, {t_5*t_65-t_12*t_74}, {t_27*t_65-t_22*t_74}, {t_29*t_65-t_23*t_74},
{t_31*t_65-t_24*t_74}, {t_33*t_77-t_39*t_82}, {t_34*t_77-t_41*t_82}, {t_35*t_77-t_42*t_82}, {t_59*t_77-t_52*t_82}, {t_61*t_77-t_54*t_82}, {t_62*t_77-t_55*t_82}, {t_64*t_74-t_75*t_77},
{t_63*t_65-t_70*t_77}, {t_69*t_77-t_74*t_78}, {t_73*t_77-t_65*t_79}, {t_65*t_67-t_72*t_82}, {t_65*t_80-t_71*t_82}, {t_66*t_74-t_68*t_82}, {t_74*t_81-t_76*t_82}}
(not all the $t_i$ variables are used, that's why I claim the ring has 44, not 82 generators). Note that most of the generators are binomials - and there exists effective (or at least, more effective) algorithms for decomposing binomial ideals. Is this possible to use somehow?
So how did this ideal come about? Well, it all started with a triangulated simplicial 3-sphere, which give rise to a monomial ideal. (Specifially, $x_1cdots x_n$ is in the ideal iff $x_1cdots x_n$ is not a face of the sphere) Then we try to perturb this ideal and look at the deformation space.
Now, there are results saying that smoothings (in the sense of deformation theory) of the sphere give rise to interesting varieties, for example Calabi-Yau varieties. In my case, we know there's a deformation to the Grassmannian $G(3,6)$. Anyways - I used a Macaulay2 package by Nathan Ilten to start computing the deformation space. The large ideal above consists of the initial terms of the generators of this space (so I guess this is in some sense the tangent space).
What I'm looking for is a yes/no-answer whether this is a feasible task, and if so, what strategies I may use.
algebraic-geometry commutative-algebra ideals macaulay2
$endgroup$
Short version:
I'd like to do a primary decomposition of an ideal with 38 generators in a polynomial ring with 44 generators. However, the ideal seems far too large to naively decompose in, say, Macaulay2 (suffice to say I let my computer work all night with no result). Does there exist any "tricks" to do such a computation?
More context:
The ideal I'm trying to decompose is this:
I = ideal matrix {{t_2*t_22-t_7*t_27}, {t_4*t_22+t_2*t_23-t_10*t_27-t_7*t_29}, {t_5*t_22+t_2*t_24-t_12*t_27-t_7*t_31}, {t_4*t_23-t_10*t_29}, {t_5*t_24-t_12*t_31}, {t_5*t_72*t_81-t_12*t_67*t_76+t_24*t_68*t_80-t_31*t_66*t_71}, {t_63*t_73-t_70*t_79},
{t_67*t_71-t_72*t_80}, {t_41*t_69*t_81-t_34*t_76*t_78-t_54*t_66*t_5+t_61*t_64*t_68}, {t_64*t_69-t_75*t_78}, {t_66*t_76-t_68*t_81}, {t_4*t_64*t_73-t_10*t_75*t_79+t_23*t_63*t_69-t_29*t_70*t_78}, {t_39*t_73*t_80-t_33*t_71*t_79-t_52*t_67*t_70+t_59*t_63*t_72}, {t_33*t_52-t_39*t_59}, {t_35*t_52+t_33*t_55-t_42*t_59-t_39*t_62}, {t_34*t_54-t_41*t_61},
{t_35*t_54+t_34*t_55-t_42*t_61-t_41*t_62}, {t_35*t_55-t_42*t_62}, {t_2*t_65-t_7*t_74}, {t_4*t_65-t_10*t_74}, {t_5*t_65-t_12*t_74}, {t_27*t_65-t_22*t_74}, {t_29*t_65-t_23*t_74},
{t_31*t_65-t_24*t_74}, {t_33*t_77-t_39*t_82}, {t_34*t_77-t_41*t_82}, {t_35*t_77-t_42*t_82}, {t_59*t_77-t_52*t_82}, {t_61*t_77-t_54*t_82}, {t_62*t_77-t_55*t_82}, {t_64*t_74-t_75*t_77},
{t_63*t_65-t_70*t_77}, {t_69*t_77-t_74*t_78}, {t_73*t_77-t_65*t_79}, {t_65*t_67-t_72*t_82}, {t_65*t_80-t_71*t_82}, {t_66*t_74-t_68*t_82}, {t_74*t_81-t_76*t_82}}
(not all the $t_i$ variables are used, that's why I claim the ring has 44, not 82 generators). Note that most of the generators are binomials - and there exists effective (or at least, more effective) algorithms for decomposing binomial ideals. Is this possible to use somehow?
So how did this ideal come about? Well, it all started with a triangulated simplicial 3-sphere, which give rise to a monomial ideal. (Specifially, $x_1cdots x_n$ is in the ideal iff $x_1cdots x_n$ is not a face of the sphere) Then we try to perturb this ideal and look at the deformation space.
Now, there are results saying that smoothings (in the sense of deformation theory) of the sphere give rise to interesting varieties, for example Calabi-Yau varieties. In my case, we know there's a deformation to the Grassmannian $G(3,6)$. Anyways - I used a Macaulay2 package by Nathan Ilten to start computing the deformation space. The large ideal above consists of the initial terms of the generators of this space (so I guess this is in some sense the tangent space).
What I'm looking for is a yes/no-answer whether this is a feasible task, and if so, what strategies I may use.
algebraic-geometry commutative-algebra ideals macaulay2
algebraic-geometry commutative-algebra ideals macaulay2
edited Dec 9 '18 at 0:04
Rodrigo de Azevedo
12.9k41856
12.9k41856
asked Aug 31 '12 at 10:02
Fredrik MeyerFredrik Meyer
15.2k24065
15.2k24065
$begingroup$
Naive suggestion: have you tried Sage online? I often found this much quicker than macaulay2, mostly because the code will run on a Sage server instead of your own computer. If that doesn't work then you'll need to be more cunning, but it's something I'd try if you haven't already.
$endgroup$
– mdp
Aug 31 '12 at 11:07
$begingroup$
@MattPressland: Thanks, I hadn't thought of that. Trying it now. Do you have any thoughts on whether I should use Sage's polynomial ring functionality, or use the built-in Macaulay2-interface?
$endgroup$
– Fredrik Meyer
Aug 31 '12 at 12:52
$begingroup$
When I did these kinds of calculations I used the Sage functions, but I don't know whether this is better or worse.
$endgroup$
– mdp
Aug 31 '12 at 12:57
add a comment |
$begingroup$
Naive suggestion: have you tried Sage online? I often found this much quicker than macaulay2, mostly because the code will run on a Sage server instead of your own computer. If that doesn't work then you'll need to be more cunning, but it's something I'd try if you haven't already.
$endgroup$
– mdp
Aug 31 '12 at 11:07
$begingroup$
@MattPressland: Thanks, I hadn't thought of that. Trying it now. Do you have any thoughts on whether I should use Sage's polynomial ring functionality, or use the built-in Macaulay2-interface?
$endgroup$
– Fredrik Meyer
Aug 31 '12 at 12:52
$begingroup$
When I did these kinds of calculations I used the Sage functions, but I don't know whether this is better or worse.
$endgroup$
– mdp
Aug 31 '12 at 12:57
$begingroup$
Naive suggestion: have you tried Sage online? I often found this much quicker than macaulay2, mostly because the code will run on a Sage server instead of your own computer. If that doesn't work then you'll need to be more cunning, but it's something I'd try if you haven't already.
$endgroup$
– mdp
Aug 31 '12 at 11:07
$begingroup$
Naive suggestion: have you tried Sage online? I often found this much quicker than macaulay2, mostly because the code will run on a Sage server instead of your own computer. If that doesn't work then you'll need to be more cunning, but it's something I'd try if you haven't already.
$endgroup$
– mdp
Aug 31 '12 at 11:07
$begingroup$
@MattPressland: Thanks, I hadn't thought of that. Trying it now. Do you have any thoughts on whether I should use Sage's polynomial ring functionality, or use the built-in Macaulay2-interface?
$endgroup$
– Fredrik Meyer
Aug 31 '12 at 12:52
$begingroup$
@MattPressland: Thanks, I hadn't thought of that. Trying it now. Do you have any thoughts on whether I should use Sage's polynomial ring functionality, or use the built-in Macaulay2-interface?
$endgroup$
– Fredrik Meyer
Aug 31 '12 at 12:52
$begingroup$
When I did these kinds of calculations I used the Sage functions, but I don't know whether this is better or worse.
$endgroup$
– mdp
Aug 31 '12 at 12:57
$begingroup$
When I did these kinds of calculations I used the Sage functions, but I don't know whether this is better or worse.
$endgroup$
– mdp
Aug 31 '12 at 12:57
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%2f189209%2fprimary-decomposition-of-large-ideals%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%2f189209%2fprimary-decomposition-of-large-ideals%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$
Naive suggestion: have you tried Sage online? I often found this much quicker than macaulay2, mostly because the code will run on a Sage server instead of your own computer. If that doesn't work then you'll need to be more cunning, but it's something I'd try if you haven't already.
$endgroup$
– mdp
Aug 31 '12 at 11:07
$begingroup$
@MattPressland: Thanks, I hadn't thought of that. Trying it now. Do you have any thoughts on whether I should use Sage's polynomial ring functionality, or use the built-in Macaulay2-interface?
$endgroup$
– Fredrik Meyer
Aug 31 '12 at 12:52
$begingroup$
When I did these kinds of calculations I used the Sage functions, but I don't know whether this is better or worse.
$endgroup$
– mdp
Aug 31 '12 at 12:57