Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Added example where Strategy=>Unmixed can be faster than Strategy=>De… #4

Open
wants to merge 1 commit into
base: MinimalPrimes
Choose a base branch
from
Open

Added example where Strategy=>Unmixed can be faster than Strategy=>De… #4

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions M2/Macaulay2/packages/MinimalPrimes/doc.m2
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -234,6 +234,15 @@ Node
I = intersect(ideal(a^2,b^2,c), ideal(a,b^3,c^2))
elapsedTime radical(ideal I_*, Strategy => Monomial)
elapsedTime radical(ideal I_*, Unmixed => true)
Text
Sometimes when it is computationally expensive to compute the set of minimal primes of an
ideal the strategy Unmixed can be useful for computing the radical as it does so without
computing the set of minimal primes. The example below demonstrates one such instance.
Example
R = QQ[x,y]
I = ideal(x^250 - y^250)
elapsedTime radical(ideal I_*, Strategy => Decompose)
elapsedTime radical(ideal I_*, Strategy => Unmixed)
Text
For another example, see @TO "PrimaryDecomposition :: PrimaryDecomposition"@.
References
Expand Down