Skip to content

Update MultiplicitySequence to use "new" Polyhedra #3810

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

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

Update MultiplicitySequence to use "new" Polyhedra #3810

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
8 changes: 4 additions & 4 deletions M2/Macaulay2/packages/MultiplicitySequence.m2
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -23,7 +23,7 @@ newPackage(
"Normaliz",
"PrimaryDecomposition",
"MinimalPrimes",
"OldPolyhedra",
"Polyhedra",
},
Certification => {
"journal name" => "Journal of Software for Algebra and Geometry",
Expand Down Expand Up @@ -213,7 +213,7 @@ monReduction Ideal := MonomialIdeal => I -> (
--- from a matrix M extract the rows where all the entries are not zero
isBddFacet := (n, M) -> (
s := rank source M; --- # of columns
mutableM := mutableIdentity (ZZ,s); --- row as a vector
mutableM := mutableIdentity (ring M,s); --- row as a vector
for i from 0 to (s - 1) do (mutableM_(i,i) = M_(n,i));
det mutableM != 0 --- No if 0, Yes otherwise
)
Expand Down Expand Up @@ -245,7 +245,7 @@ monAnalyticSpread Ideal := ZZ => I -> (
Mm := M_0;
Mv := M_1;
r := rank target Mm; --- # of rows
1 + max apply(r, p -> dim convexHull vertices intersection (Mm, Mv, Mm^{p}, Mv^{p}))
1 + max apply(r, p -> dim convexHull vertices polyhedronFromHData (Mm, Mv, Mm^{p}, Mv^{p}))
-- monAS := 0;
-- for p from 0 to r-1 do (
-- face := intersection (Mm, Mv, Mm^{p}, Mv^{p});
Expand All @@ -268,7 +268,7 @@ monjMult Ideal := ZZ => I -> (
monj := 0;
for p from 0 to r-1 do (
if isBddFacet(p, Mm) then (
face := intersection (Mm, Mv, Mm^{p}, Mv^{p});
face := polyhedronFromHData (Mm, Mv, Mm^{p}, Mv^{p});
monj = monj + (d!)*(volume convexHull pyrF(vertices face));
);
);
Expand Down
Loading