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

Remove examples showing less efficient algorithms from Points docs #1838

Merged
merged 1 commit into from
Jan 19, 2021
Merged

Remove examples showing less efficient algorithms from Points docs #1838

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
18 changes: 1 addition & 17 deletions M2/Macaulay2/packages/Points.m2
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -958,16 +958,9 @@ document {
monomialIdeal G == inG
///,
PARA{},
"Next a larger example that shows that the Buchberger-Moeller algorithm in ",
"The Buchberger-Moeller algorithm in ",
TT "points", " may be faster than the alternative method using the intersection
of the ideals for each point.",
EXAMPLE lines ///
R = ZZ/32003[vars(0..4), MonomialOrder=>Lex]
M = random(ZZ^5, ZZ^150)
time J = affinePointsByIntersection(M,R);
time C = affinePoints(M,R);
J == C_2
///,
SeeAlso => {affinePointsByIntersection}
}

Expand Down Expand Up @@ -1148,15 +1141,6 @@ doc ///
Text
This algorithm may be faster than
computing the intersection of the ideals of each projective point.

Example
K = ZZ/32003
R = K[z_0..z_5]
M = random(ZZ^6,ZZ^150)
elapsedTime (inG,G) = projectivePoints(M,R);
elapsedTime H = projectivePointsByIntersection(M,R);
G == H

Caveat
This function removes zero columns of @TT "M"@ and duplicate columns giving rise to the same projective point (which prevent the algorithm from terminating). The user can bypass this step with the option @TT "VerifyPoints"@.
SeeAlso
Expand Down