One Hat Cyber Team
Your IP :
216.73.216.216
Server IP :
194.44.31.54
Server :
Linux zen.imath.kiev.ua 4.18.0-553.77.1.el8_10.x86_64 #1 SMP Fri Oct 3 14:30:23 UTC 2025 x86_64
Server Software :
Apache/2.4.37 (Rocky Linux) OpenSSL/1.1.1k
PHP Version :
5.6.40
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
usr
/
share
/
Macaulay2
/
View File Name :
gfanInterface.m2
-- -*- coding: utf-8 -*- --TODO: gfan errors printed on screen in: -- QQ[x,y,z,w]; I=ideal(x-y,w+y-x); gfanTropicalStartingCone I; tropicalVariety I; tropicalVariety ideal(x); newPackage( "gfanInterface", Version => "0.5", Date => "May 15, 2021", Authors => { {Name => "Mike Stillman", Email => "mike@math.cornell.edu", HomePage => ""}, {Name => "Andrew Hoefel", Email => "andrew.hoefel@gmail.com", HomePage =>"http://www.mast.queensu.ca/~ahhoefel/"}, { Name => "Diane Maclagan", Email => "D.Maclagan@warwick.ac.uk", HomePage => "http://homepages.warwick.ac.uk/staff/D.Maclagan/", Maintainer => true }, {Name => "Josephine Yu", Email => "jyu@math.gatech.edu", HomePage => "http://people.math.gatech.edu/~jyu67/"}}, Headline => "interface to Anders Jensen's Gfan software", Keywords => {"Interfaces"}, Configuration => { "path" => "", "fig2devpath" => "", "keepfiles" => true, "verbose" => false, "cachePolyhedralOutput" => true }, PackageExports => {"Polyhedra"} ) export { "MarkedPolynomialList", "markedPolynomialList", "MPLConverter", "polymakeFanToFan", "polymakeConeToCone", "gfan", -- done! "gfanBuchberger", -- done! "gfanDoesIdealContain", -- done! "gfanFanCommonRefinement", -- v0.4 done! "gfanFanLink", -- v0.4 needs a non-star example "gfanFanProduct", -- v0.4 done! "gfanGroebnerCone", -- done! "gfanHomogeneitySpace", -- done! "gfanHomogenize", -- done! "gfanInitialForms", -- done! "gfanInteractive", -- done! i.e. not implemented "gfanIsMarkedGroebnerBasis", -- done! "gfanKrullDimension", -- done! "gfanLatticeIdeal", -- v0.4 done! "gfanLeadingTerms", -- done! "gfanMarkPolynomialSet", -- done! "gfanMinkowskiSum", -- v0.4 -- implemented, documented, but i don't understand/agree with the output "gfanMinors", -- v0.4 done! "gfanOverIntegers", "gfanMixedVolume", -- needs gfan 0.6 or higher "gfanPolynomialSetUnion", -- done! "gfanRender", "gfanRenderStaircase", "gfanResultantFan", -- needs gfan 0.6 or higher "gfanSaturation", -- done! "gfanSecondaryFan", -- v0.4 -- done! but could use better doc "gfanStableIntersection", "gfanStats", -- done! "gfanSubstitute", -- done! "gfanToLatex", -- done! "gfanToPolyhedralFan", -- done! "gfanTropicalBasis", -- done! but could use an explanation of the example "gfanTropicalBruteForce", -- done! "gfanTropicalEvaluation", -- v0.4 -- done! "gfanTropicalFunction", -- v0.4 -- done! "gfanTropicalHyperSurface", -- v0.4 -- done! "gfanTropicalHyperSurfaceReconstruction", "gfanTropicalIntersection", -- done! "gfanTropicalLifting", "gfanTropicalLinearSpace", -- v0.4 -- done! doc needs double checking "gfanTropicalMultiplicity", -- example needed. "gfanTropicalRank", -- v0.4 -- done! "gfanTropicalStartingCone", -- done! "gfanTropicalTraverse", -- done! "gfanTropicalWeilDivisor", -- v0.4 "gfanFunctions", -- for testing purposes "gfanParsePolyhedralFan", -- for external use -- "gfanRingToString", -- to make gfan input -- "gfanPolynomialListToString", -- to make gfan input -- "gfanVectorToString", -- to make gfan input -- "gfanVectorListToString", -- to make gfan input -- "gfanVectorListListToString", -- to make gfan input "gfanVersion", "toPolymakeFormat", "multiplicitiesReorder" } gfanVerbose = gfanInterface#Options#Configuration#"verbose" -- for backward compatibility if not programPaths#?"gfan" and gfanInterface#Options#Configuration#"path" != "" then programPaths#"gfan" = gfanInterface#Options#Configuration#"path" if not programPaths#?"fig2dev" and gfanInterface#Options#Configuration#"fig2devpath" != "" then programPaths#"fig2dev" = gfanInterface#Options#Configuration#"fig2devpath" gfanProgram = null fig2devProgram = null gfanKeepFiles = gfanInterface#Options#Configuration#"keepfiles" gfanCachePolyhedralOutput = gfanInterface#Options#Configuration#"cachePolyhedralOutput" --minmax switch disabled -- gfanTropicalMin = not gfanInterface#Options#Configuration#"tropicalMax" GfanTypes = { { "sym" => "AmbientDim", "str" => "AMBIENT_DIM", "type" => "cardinal" }, { "sym" => "Dim", "str" => "DIM", "type" => "cardinal" }, { "sym" => "LinealityDim", "str" => "LINEALITY_DIM", "type" => "cardinal" }, { "sym" => "Rays", "str" => "RAYS", "type" => "matrix" }, { "sym" => "NRays", "str" => "N_RAYS", "type" => "cardinal" }, { "sym" => "LinealitySpace", "str" => "LINEALITY_SPACE", "type" => "matrix" }, { "sym" => "OrthLinealitySpace", "str" => "ORTH_LINEALITY_SPACE", "type" => "matrix" }, { "sym" => "FVector", "str" => "F_VECTOR", "type" => "vector" }, { "sym" => "Cones", "str" => "CONES", "type" => "incidenceMatrix" }, { "sym" => "MaximalCones", "str" => "MAXIMAL_CONES", "type" => "incidenceMatrix" }, { "sym" => "Pure", "str" => "PURE", "type" => "boolean" }, { "sym" => "Multiplicities", "str" => "MULTIPLICITIES", "type" => "columnVector" }, { "sym" => "RayValues", "str" => "RAY_VALUES", "type" => "matrix" }, { "sym" => "LinealityValues", "str" => "LINEALITY_VALUES", "type" => "matrix" }, { "sym" => "MaximalConesCompressed", "str" => "MAXIMAL_CONES_COMPRESSED", "type" => "incidenceMatrix" }, { "sym" => "ConesCompressed", "str" => "CONES_COMPRESSED", "type" => "incidenceMatrix" }, { "sym" => "MultiplicitiesCompressed", "str" => "MULTIPLICITIES_COMPRESSED", "type" => "columnVector" }, { "sym" => "Dim", "str" => "DIM", "type" => "cardinal" }, { "sym" => "ImpliedEquations", "str" => "IMPLIED_EQUATIONS", "type" => "matrix" }, { "sym" => "Facets", "str" => "FACETS", "type" => "matrix" }, { "sym" => "RelativeInteriorPoint", "str" => "RELATIVE_INTERIOR_POINT", "type" => "vector" }, --{ "sym" => "MYEULER", -- undocumented by gfan -- "str" => "MY_EULER", -- "type" => "cardinal" --}, { "sym" => "Simplicial", -- undocumented by gfan "str" => "SIMPLICIAL", "type" => "boolean" } } / hashTable PolyhedralNameToGfanName := hashTable apply(GfanTypes, T->(T#"sym"=>T#"str")) GfanNameToPolyhedralName := hashTable apply(GfanTypes, T->(T#"str"=>T#"sym")) MarkedPolynomialList = new Type of List MarkedPolynomialList.synonym = "marked polynomial list"; -- Currently: this is a list {inL,L}, where -- inL is a list of monomials (with coefficient, often 1) -- L is a list of polynomials -- and L and inL have the same length, and the -- the monomial inL#i is the marked monomial, which -- should occur with the same coefficient in L#i. markedPolynomialList = method(); markedPolynomialList List := L -> ( if #L =!= 2 then error("A MarkedPolynomialList must be a list containing " | "a list of initial terms and a list of polynomials." ); if #(first L) =!= #(last L) then error("The lists of initial terms and polynomials in a " | "MarkedPolynomialList must have the same length." ); if #(first L) =!= 0 then ( R := class first first L; if class R =!= PolynomialRing then error("Initial terms and polynomials in a MarkedPolynomialList " | "should be elements of a polynomial ring." ); scan(transpose L, t -> ( m := first t; f := last t; if class m =!= R or class f =!= R then error("Each initial term and polynomial of a MarkedPolynomialList " | "should be a member of the same polynomial ring." ); if #(terms m) =!= 1 then error("Initial terms of a MarkedPolynomialList should consist " | "of a single term." ); if not member(m, terms f) then error("Each initial terms of a MarkedPolynomialList should " | "appear in its corresponding polynomial. " | "(" | toString m | " is not a term of " | toString f | ")." ); ) ); ); new MarkedPolynomialList from L ) expression MarkedPolynomialList := L -> hold apply(transpose L, t -> ( m := t#0; f := t#1; Sum Parenthesize expression m + expression(f-m) )) net MarkedPolynomialList := L -> net expression L toString MarkedPolynomialList := L -> toString expression L texMath MarkedPolynomialList := L -> texMath expression L RingMap MarkedPolynomialList := (F, L) -> L/(a-> a/F) -------------------------------------------------------- -------------------------------------------------------- -- PARSING FUNCTIONS -------------------------------------------------------- -------------------------------------------------------- gfanParseList = method(); gfanParseList String := (S) -> ( S = replace("\n", "", S); stack := {}; r := regex(///[\{,\}]///, S); popstate := false; while #r === 1 do ( startpos := first first r; character := substring(startpos,1,S); prestring := substring(0, startpos, S); S = substring(startpos+1, #S,S); if character == "," then ( if not popstate then ( stack = append(drop(stack,-1), append(last stack, prestring)); ); popstate = false; ) else if character == "{" then ( stack = append(stack, {}); ) else if #stack == 0 then ( error "Parsing error"; ) else if #stack == 1 then ( if not popstate then ( stack = append(drop(stack,-1), append(last stack, prestring)); ); return first stack; ) else ( if not popstate then ( stack = append(drop(stack,-1), append(last stack, prestring)); ); stack = append(drop(stack,-2), append(stack#(#stack -2), last stack)); popstate = true; ); r = regex(///[\{,\}]///, S); ); error "Parsing error"; ) gfanParseMarkedPoly = method(); gfanParseMarkedPoly String := (S) -> ( indices := first regex(///\`[:space:]*.[^+-]*///,S); return { value substring(first indices, last indices,S), value S}; --match from the start of the string all whitespace, one --non-white space character and then everything until the +/- ) gfanParseIdeals = method() gfanParseIdeals String := (s) -> ( --needs to be simplified G := separate("\n,",s); firstLine := G#0; firstLine = separate("\n", firstLine); firstLine = drop(firstLine, 1); -- remove the ring from the first line tempStr := ""; scan(firstLine, t -> tempStr = concatenate(tempStr, "\n", t)); -- build the firstline G = drop(G,1); -- drop the old first entry G = prepend(tempStr, G); -- and then add the first entry minus the ring H := apply(G, t -> replace(///[\{\}]*///,"",t)); apply(H, s -> value("{"|s|"}")) ) gfanParseIdeal = method() gfanParseIdeal String := (s) -> ( G := separate("\\]",s); G = drop(G,1); value concatenate G ) gfanParseMarkedIdeal = method() gfanParseMarkedIdeal String := (s) -> ( G := separate("\\]",s); G = drop(G,1); markedPolynomialList transpose apply(gfanParseList(concatenate G), p -> gfanParseMarkedPoly(p)) ) gfanParseMarkedIdeals = method() gfanParseMarkedIdeals String := (s) -> ( G := separate("\\]",s); G = drop(G,1); apply(gfanParseList(concatenate G), L -> markedPolynomialList transpose apply(L, p -> gfanParseMarkedPoly(p))) ) gfanParseMPL = method() gfanParseMPL String := (s) -> ( G := separate("\\]",s); G = drop(G,1); new MarkedPolynomialList from transpose apply(gfanParseList(concatenate G), p -> gfanParseMarkedPoly(p)) ) gfanParseLMPL = method() gfanParseLMPL String := (s) -> ( G := separate("\\]",s); G = drop(G,1); apply(gfanParseList(concatenate G), L -> new MarkedPolynomialList from transpose apply(L, p -> gfanParseMarkedPoly(p))) ) gfanParseMPLPair = method() gfanParseMPLPair String := (s) -> ( G := separate("\n",s); G = drop(G,1); -- drop the ring L := gfanParseList("{"| replace(///\{///, ",{", concatenate G ) | "}"); P := {apply(L#1, gfanParseMarkedPoly), apply(L#2, gfanParseMarkedPoly)}; apply(P, c -> new MarkedPolynomialList from transpose c) ) gfanParseIdealPair = method() gfanParseIdealPair String := (s) -> ( G := separate("\n",s); G = drop(G,1); drop(value ("{"| replace(///\{///, ",{", concatenate G ) | "}"), 1) ) gfanParseMarkedIdealPair = method() gfanParseMarkedIdealPair String := (s) -> ( G := separate("\n",s); G = concatenate drop(G,1); apply(drop(regex(///(\{[^\}]*\})(\{[^\}]*\})///, G),1), i-> transpose apply(gfanParseList(substring(first i, last i, G)), p-> gfanParseMarkedPoly(p))) ) gfanParseInteger = method() gfanParseInteger String := (s) -> value s gfanParseBool = method() gfanParseBool String := (s) -> s == "true\n" gfanParseBoolInteger = method() gfanParseBoolInteger String := (s) -> s == "1\n" ------------------------------------------ -- Gfan Parsing Polymake-style data ------------------------------------------ --this function reorder the multiplicities according to the order --polyhedra gave to the maximal cones. In fact we construct a fan with --fanFromGfan which reorders maximal cones and rays multiplicitiesReorder= method() multiplicitiesReorder (List):=(L)->( --L_0= matrix of rays of the fan after using fanFromGfan --L_1=list of maximal cones after using fanFromGfan --L_2=matrix of rays before before using fanFromGfan --L_3=list of maximal cones before using fanFromGfan --L_4=list of multiplicities before using fanFromGfan Mnew:=L_1; myrays:=L_2; M:=L_3; Mult:=L_4; newrays:=L_0; newmcone:={}; newmcones:={}; newmult:={}; for i from 0 to #M-1 do(newmcone={};for j from 0 to #(M_i)-1 do (for k from 0 to numColumns(newrays)-1 do (if (newrays_k)==myrays_((M_i)_j) then (newmcone=append(newmcone,k);) ;k=k+1) ;j=j+1);newmcones=append(newmcones, newmcone);i=i+1) ; for i from 0 to #Mnew-1 do(for j from 0 to #newmcones-1 do(if set ((Mnew)_i)=== set(newmcones_j)then ( newmult=append(newmult,Mult_j)) ;j=j+1);i=i+1); newmult ) --minmax switch is now disabled --gfanParsePolyhedralFan = method(TypicalValue => PolyhedralObject, Options => {"GfanFileName" => null, "TropicalMinConventionApplies" => false }) gfanParsePolyhedralFan = method(TypicalValue => PolyhedralObject, Options => {"GfanFileName" => null}) gfanParsePolyhedralFan String := o -> s -> ( if debugLevel>0 then (print s); B := select(sublists(lines s, l -> #l =!= 0, toList, l -> null), l -> l =!= null); header := first B; --first list of lines if #B < 2 and #header < 2 then error(concatenate header); -- blocks are lists of the form {typeString, list of lines, parsed value} blocks := apply(drop(B,1), L -> gfanParseBlock L); rawBlocks := new MutableHashTable from apply(blocks, P -> first P => P#1); parsedBlocks := apply(select(blocks, Q -> last Q =!= null), P -> GfanNameToPolyhedralName#(first P) => last P); myhash := new MutableHashTable from parsedBlocks; --minmax switch disabled -- if gfanTropicalMin and o#"TropicalMinConventionApplies" then ( -- --print("tropical min convention invoked while parsing polyhedral fan"); -- -- -- adjust the fan -- myhash#"Rays" = apply(myhash#"Rays", ray-> -ray); -- -- -- adjust rawBlocks -- myList := {"RAYS"}; -- apply(length myhash#"Rays", i -> ( -- myVector := between(" ", apply(myhash#"Rays"#i, coord -> toString(coord))); -- myString := concatenate(myVector) | " # " | toString(i); -- myList = append(myList, myString); -- )); -- rawBlocks#"RAYS" = myList; -- -- -- adjust raw-string -- myBlocks := prepend(header, values rawBlocks); -- s = concatenate between("\n\n", apply(myBlocks, lines -> between("\n", lines))); -- ); P := new gfanParseHeader(header) from myhash; if gfanCachePolyhedralOutput then ( -- !! important: caching does not respect TROPICAL-MIN -- the cached data can be found in the path P#"GfanFileName" -- needs edit: P#"GfanFileRawString" -- needs edit: P#"GfanFileRawBlocks" P#"GfanFileHeader" = stack header; P#"GfanFileRawString" = s; P#"GfanFileRawBlocks" = rawBlocks; ); if gfanKeepFiles and o#?"GfanFileName" and o#"GfanFileName" =!= null then P#"GfanFileName" = o#"GfanFileName"; --now we turn this hashtable into a fan according to polyhedra --this S is the local object that will be the fan S:={}; myrays:={}; mylinspace:={}; mymaximalcones:={}; -- the other option for the two “if” below is there because the output of gfan -- might not be a fan with rays,linspace and maximal cones but a cone defined -- by equations if (P#"AmbientDim" < 0) then return "error: this fan is empty"; if P#?"Rays"==false or P#"Rays"=={} then myrays=map(ZZ^(P#"AmbientDim"),ZZ^0,0) else myrays=transpose matrix P#"Rays"; if P#?"MaximalCones"==false then mymaximalcones={{}} else mymaximalcones= P#"MaximalCones"; if P#"LinealitySpace"=={} then mylinspace=map(ZZ^(P#"AmbientDim"),ZZ^0,0) else mylinspace=transpose matrix P#"LinealitySpace"; if P#?"Rays"==false then S=fan(myrays,mylinspace,mymaximalcones) else ( fVector := P#"FVector"; while (#fVector < P#"Dim"+1) do (fVector = {0}|fVector); S=fanFromGfan({myrays,mylinspace,mymaximalcones,P#"Dim",P#"Pure",P#"Simplicial",fVector}); ); --re-writing the multiplicities according to the new order of maximal cones if P#?"Multiplicities" then ( newMult:=multiplicitiesReorder({rays S,maxCones S,myrays,mymaximalcones,P#"Multiplicities"}); S,newMult ) else (S) ) gfanParseHeader = method(TypicalValue => Type) gfanParseHeader List := (L) -> ( typePosition := position(L, l -> "_type" == first separate(" ", l)); typeLine := L#typePosition; typeWords := separate(" ", typeLine); if #typeWords === 2 and typeWords#1 == "PolyhedralCone" then Cone else if #typeWords === 2 and (typeWords#1 == "PolyhedralFan" or typeWords#1 == "SymmetricFan") then Fan else PolyhedralObject ) gfanParseBlock = method(TypicalValue => List) gfanParseBlock List := (L) -> ( typeString := first L; data := drop(L,1); typePosition := position(GfanTypes, T -> T#"str" == typeString); if typePosition === null then return typeString => null; -- Unrecognized type typeTuple := GfanTypes#typePosition; return {typeString, L, gfanParseGfanType(typeTuple#"type", data)}; ) gfanParseGfanType = method() gfanParseGfanType (String, List) := (T, L) -> ( L = apply(L, str -> replace("[[:space:]]*#.*|[[:space:]]+$","" ,str)); if T == "cardinal" then ( value first L ) else if T == "matrix" then ( apply(L, l -> select(separateRegexp(" +", l) / value, x -> x =!= null)) ) else if T == "incidenceMatrix" then ( apply(L, l -> value replace("[[:space:]]+", ",", l)) ) else if T == "boolean" then ( 1 === value first L ) else if T == "vector" then ( if (#L == 0) then return L; select(separateRegexp(" +", first L) / value, x -> x =!= null) ) else if T == "columnVector" then ( flatten apply(L, l -> select(separateRegexp(" +", l) / value, x -> x =!= null)) ) ) -- {* -- polymakeFanToFan = method() -- polymakeFanToFan PolymakeFan := (F) -> ( -- linealitySpace := posHull transpose matrix(F#"LINEALITY_SPACE" | - F#"LINEALITY_SPACE"); -- fan apply(F#"MAXIMAL_CONES", L -> posHull(posHull transpose matrix apply(L, i -> F#"RAYS"#i), linealitySpace)) -- ) -- polymakeConeToCone = method() -- polymakeConeToCone PolymakeCone := (C) -> ( -- linealitySpace := posHull transpose matrix(C#"LINEALITY_SPACE" | - C#"LINEALITY_SPACE"); -- posHull(posHull transpose matrix C#"FACETS", linealitySpace) -- ) -- polymakeFan = method() -- polymakeFan (Matrix,Matrix,List) := (rays, lineality, maxcones) -> ( -- ambientdim := numRows(rays); -- lindim := numColumns(lineality); -- dim := numColumns(lineality) + max apply(maxcones, c-> #c); -- orthlin := entries transpose gens kernel lineality; -- lin := entries transpose lineality; -- r := entries transpose rays; -- numr := numColumns(rays); -- pure := all(maxcones, c -> #c == dim); -- --rawstr := blah; -- --Not done yet! -- ) -- *} ------------------------------------------ -- gfan toString functions ------------------------------------------ -- These functions produce strings that -- gfan can read ------------------------------------------ --Version of gfanToExternalString that removes "(" and ")" gfanToExternalString := (L) -> ( concatenate(delete(")",delete("(",characters(toExternalString(L))))) ) joinStrings = (S, between, before, after) -> ( str := before | first S; S = drop(S, 1); scan(S, s -> str = str | between | s); str | after ) gfanSymbolToString = method() gfanSymbolToString Symbol := (X) -> ( toString(X) | "\n" --- gfanToExternalString will write the word symbol if X is assigned --- and this is not desirable ) gfanIdealToString = method() gfanIdealToString Ideal := (I) -> gfanPolynomialListToString flatten entries gens I gfanPolynomialListToString = method() gfanPolynomialListToString List := (L) -> joinStrings(L/gfanToExternalString, "," | newline, "{", "}" | newline) --Takes a marked polynomial as a pair: {initial term, polynomial} gfanMarkedPolynomialToString = method() gfanMarkedPolynomialToString List := (L) -> ( out := gfanToExternalString(first L); if (last L) - (first L) != 0 then out = out | " + " | gfanToExternalString((last L) - (first L)); out ) gfanMPLToString = method() gfanMPLToString List := (L) -> ( L = (transpose L) / gfanMarkedPolynomialToString; joinStrings(L, "," | newline, "{", "}" | newline) ) gfanListOfPolynomialListsToString = method() gfanListOfPolynomialListsToString := (L) -> ( out := "{"; n := #L - 1; for i from 0 to n do ( out = out | gfanPolynomialListToString(L#i); if i < n then out = out | "," else out = out | "}"; out = out | newline; ); return out; ) --list of marked polynomial lists to string gfanLMPLToString = method() gfanLMPLToString := (L) -> ( out := "{"; n := #L - 1; for i from 0 to n do ( out = out | gfanMPLToString(L#i); if i < n then out = out | "," else out = out | "}"; out = out | newline; ); return out; ) gfanVectorToString = method() gfanVectorToString List := (L) -> ( if L === null then return ""; out := "("; n := #L - 1; for i from 0 to n do ( out = out | gfanToExternalString(L#i); if i < n then out = out | "," else out = out | ")"; out = out | newline; ); return out; ) gfanVectorListToString = method() gfanVectorListToString := (L) -> ( if L === null then return ""; out := "{"; n := #L - 1; for i from 0 to n do ( out = out | gfanVectorToString(L#i); if i < n then out = out | "," else out = out | "}"; out = out | newline; ); return out; ) gfanVectorListListToString = method() gfanVectorListListToString List := (L) -> ( if L === null then return ""; out := "{"; n := #L - 1; for i from 0 to n do ( out = out | gfanVectorListToString(L#i); if i < n then out = out | "," else out = out | "}"; out = out | newline; ); return out; ) gfanIntegerListToString = method() gfanIntegerListToString := (L) -> if L === null then "" else toString L gfanMatrixToString = method() gfanMatrixToString := (M) -> if M === null then "" else toString entries M gfanVectorConfigToString = method() gfanVectorConfigToString := (L) -> ( if L === null then "" else joinStrings( apply(L, a -> joinStrings( a/toString, ",", "(", ")")), ",", "{", "}") ) gfanRingToString = method() gfanRingToString PolynomialRing := (R) -> ( p := char R; out := if p === 0 then "Q" else "Z/"|p|"Z"; out = out | gfanToExternalString(new Array from gens R) | newline; return out; ) gfanMPLToRingToString = method() gfanMPLToRingToString List := (L) -> ( R := ring first last L; p := char R; out := if p === 0 then "Q" else "Z/"|p|"Z"; out = out | gfanToExternalString(new Array from gens R) | newline; return out; ) -------------------------------------------------------- -- gfan prefix bug section -------------------------------------------------------- gfanConvertToNewRing = method() gfanConvertToNewRing (PolynomialRing) := R1 -> ( --This method does all of the actual conversions. --Every other gfanConvertToNewRing uses rings --produced by this method. R1Gens := gens R1; numDigits := length (toString (#R1Gens)); R2 := (coefficientRing R1) new Array from (for i in 1..#R1Gens list ( value ("x" | demark ("",for i from 1 to numDigits-(length toString i) list "0") | toString i) ) ); R2Gens := gens R2; generatorMapping := for i in 0..#(gens R1) - 1 list (R1Gens#i =>R2Gens#i); return (map(R2, R1, generatorMapping), R2); ) gfanConvertToNewRing (RingElement) := f -> ( (ringMap, R) := gfanConvertToNewRing ring f; return (ringMap, ringMap f) ) gfanConvertToNewRing (List) := L -> ( --compute the completely flattened list of L flatL := flattenRecursive L; --If flatL is empty then return L if #flatL == 0 then ( toReturn := L; ) --Check if L is a nested list of polynomials else if class class flatL#0 === PolynomialRing then ( (ringMap, R2) := gfanConvertToNewRing ring flatL#0; toReturn = (ringMap, ringMapRecursive(L, ringMap)); ) else if class L === MarkedPolynomialList then ( (ringMap, R2) = gfanConvertToNewRing ring L#0#0; toReturn = (ringMap, new MarkedPolynomialList from {L#0/ringMap, L#1/ringMap}); ) else if class L#0 === MarkedPolynomialList then ( (ringMap, R2) = gfanConvertToNewRing ring L#0#0#0; toReturn = (ringMap, for i in 0..#L-1 list (new MarkedPolynomialList from {L#i#0/ringMap, L#i#1/ringMap})); ) else error "Unexpected input to gfanConvertToNewRing"; toReturn ) gfanConvertToNewRing (List, RingMap) := (L, ringMap) -> ( --If L is empty then return L if #L == 0 then ( toReturn := L; ) --L is a list of polynomials else if class class L#0 === PolynomialRing then ( toReturn = (ringMap, L/ringMap); ) --L is a MarkedPolynomialList else if class L === MarkedPolynomialList then ( toReturn = (ringMap, new MarkedPolynomialList from {L#0/ringMap, L#1/ringMap}); ) --L is a list of MarkedPolynomialLists else if class L#0 === MarkedPolynomialList then ( toReturn = (ringMap, for i in 0..#L-1 list (new MarkedPolynomialList from {L#i#0/ringMap, L#i#1/ringMap})); ) else error "Unexpected input to gfanConvertToNewRing"; toReturn ) gfanConvertToNewRing (Ideal) := I -> ( (ringMap, R2) := gfanConvertToNewRing ring I; return (ringMap, ringMap I); ) gfanConvertToNewRing (Ideal, RingMap) := (I, ringMap) -> ( return (ringMap, ringMap I); ) gfanRevertToOriginalRing = method() gfanRevertToOriginalRing (PolynomialRing, RingMap) := (R, ringMap) -> ( return source ringMap; ) gfanRevertToOriginalRing (Ideal, RingMap) := (I, ringMap) -> ( return ringMap^-1 I; ) gfanRevertToOriginalRing (List, RingMap) := (L, ringMap) -> ( --compute the completely flattened list of L flatL := flattenRecursive L; --If flatL is empty then return L if #flatL == 0 then ( toReturn := L; ) --Check if L is a nested list of polynomials else if class class flatL#0 === PolynomialRing then ( toReturn = inverseRingMapRecursive(L, ringMap); ) --Check if L is a list of MarkedPolynomialLists else if class L#0 === MarkedPolynomialList then( toReturn = for i in 0..#L-1 list (new MarkedPolynomialList from {L#i#0/(ringMap^-1), (L#i#1/(ringMap^-1))}); ) --Check if L is a MarkedPolynomialLists else if class L === MarkedPolynomialList then ( toReturn = new MarkedPolynomialList from {L#0/(ringMap^-1), L#1/(ringMap^-1)}; ) else error "Unexpected input to gfanRevertToOriginalRing"; toReturn ) --applies the ringMap recursively to a nested list ringMapRecursive = (L, ringMap) -> ( apply(L, e -> if class e === List then ringMapRecursive(e,ringMap) else ringMap e) ) --applies the inverse of the ringMap recursively to a nested list inverseRingMapRecursive = (L, ringMap) -> ( apply(L, e -> if class e === List then inverseRingMapRecursive(e,ringMap) else ringMap^-1 e) ) --flattens a list until it does not contain lists any longer flattenRecursive = (L) -> ( if containsList(L) then return flattenRecursive flatten L; L ) --checks if a list contains a list containsList = (L) -> ( toReturn := scan(L, e -> if class e === List then break true); if toReturn === true then return true; false ) -------------------------------------------------------- -- gfanArgumentToString -------------------------------------------------------- gfanArgumentToString = method() gfanArgumentToString (String, String, Thing) := (cmd, key, value) -> ( if value === null or value === false then return ""; cmdLineValue := false; -- whether a value is passed on the commandline if cmdLineArgs#?cmd and member(key, cmdLineArgs#cmd) then cmdLineValue = true; " " | argStrs#key | (if cmdLineValue then " " | value else "") ) ------------------------------------------------------------------ -- Make files to be read by Gfan ------------------------------------------------------------------ gfanMakeTemporaryFile = (data) -> ( tmpName := temporaryFileName(); if gfanVerbose then << "using temporary file " << tmpName << endl; tmpFile := openOut tmpName; tmpFile << data << close; tmpName ) gfanRemoveTemporaryFile = (fileName) -> if not gfanKeepFiles then removeFile fileName ------------------------------------------------------------------ -- Make Polymake-style data strings needed in gfan _fanproduct, etc. ------------------------------------------------------------------ toPolymakeFormat = method(TypicalValue => String) toPolymakeFormat(String, Matrix) := (propertyName, M) -> ( if M === null then "" else( S := propertyName|"\n"; if numRows M > 0 then S = S|replace("\\|", "", toString net M)|"\n\n" else S = S|"\n"; S ) ) toPolymakeFormat(String,Vector) := (propertyName,V) -> ( if V === null then "" else( S := propertyName|"\n"; if length V > 0 then S = S|replace("\\|", "", toString net matrix{V})|"\n\n" else S = S|"\n"; S ) ) toPolymakeFormat(String,List) := (propertyName,V) -> ( if V === null then "" else( S := propertyName|"\n"; if length V > 0 then scan(V,l -> S = S|replace(","," ",gfanToExternalString l)|"\n") else S=S|"\n\n"; S = S | "\n"; S ) ) toPolymakeFormat(String,ZZ) := (propertyName,x) -> ( if x === null then "" else propertyName|"\n"|x|"\n\n" ) toPolymakeFormat(String,Boolean) := (propertyName,x) -> ( if x === null then "" else propertyName|"\n"|(if x then "1" else "0")|"\n\n" ) --toPolymakeFormat(PolyhedralObject) := (P) -> ( -- goodkeys := select(keys P, k -> not match("Gfan", k)); -- concatenate apply(goodkeys, k-> toPolymakeFormat(PolyhedralNameToGfanName#k,P#k)|"\n\n") -- ) toPolymakeFormat(Fan) := (F) ->( raysF:=rays(F); str:=toPolymakeFormat("AMBIENT_DIM",ambDim(F)); str=concatenate(str,toPolymakeFormat("RAYS",transpose raysF)); str=concatenate(str,toPolymakeFormat("N_RAYS",rank source raysF)); L:=linealitySpace(F); str=concatenate(str,toPolymakeFormat("LINEALITY_DIM",rank L)); str=concatenate(str,toPolymakeFormat("LINEALITY_SPACE",transpose L)); conesF:=flatten apply(dim(F)+1-rank L,i->(cones(i+rank L,F))); str=concatenate(str,toPolymakeFormat("CONES", conesF)); str=concatenate(str,toPolymakeFormat("MAXIMAL_CONES", maxCones F)); return(str); ) -- {* -- makeGfanFile = method(TypicalValue => String) -- makeGfanFile(PolyhedralObject,String) := (P, fileName) ->( -- if P#"GfanFileHeader" then fileName << P#"GfanFileHeader" << endl; -- if P#"GfanFileRawString" then -- file << P#"GfanFileRawString" << endl << close -- else -- fileName << toPolymakeFormat(P) << endl << close; -- P#"GfanFileName" = fileName; -- fileName -- ) -- makePolymakeFormat(PolyhedralObject) := (P) ->( -- fileName := ""; -- if P#?"GfanFileName" and fileExists P#"GfanFileName" then -- ( fileName = P#"GfanFileName"; -- << "using existing file " << filename << endl; -- ) -- else ( -- fileName = temporaryFileName()|currentTime()|."gfan"; -- << "using temporary file " << fileName << endl; -- writeGfanFile(P,fileName); -- ) -- fileName -- ) -- *} -------------------------------------------------------- -- runGfanCommand -------------------------------------------------------- runGfanCommand = (cmd, opts, data) -> ( (out, err, fileName) := runGfanCommandCaptureBoth(cmd, opts, data); (out, fileName) ) runGfanCommandCaptureBoth = (cmd, opts, data) -> ( if gfanProgram === null then gfanProgram = findProgram("gfan", "gfan --help", Verbose => gfanVerbose, -- version 0.6 is necessary for gfanMixedVolume -- https://github.com/Macaulay2/M2/issues/1962 MinimumVersion => ("0.6", "gfan _version | head -2 | tail -1 | sed 's/gfan//'")); tmpFile := gfanMakeTemporaryFile data; args := replace("^gfan ", "", cmd) | concatenate apply(keys opts, key -> gfanArgumentToString(cmd, key, opts#key)); gfanRun := runProgram(gfanProgram, args | " < " | tmpFile, RaiseError => false, KeepFiles => gfanKeepFiles, Verbose => gfanVerbose); gfanRemoveTemporaryFile tmpFile; -- we display our own error message instead of using the runProgram -- default so we can display data if gfanRun#"return value" != 0 then error( "Gfan returned an error message.\n" | "COMMAND: " | gfanRun#"command" | "\n" | "INPUT:\n" | data | "ERROR:\n" | gfanRun#"error"); outputFileName := null; if gfanKeepFiles then outputFileName = gfanRun#"output file"; (gfanRun#"output", gfanRun#"error", "GfanFileName"=>outputFileName) ) runGfanCommandCaptureError = (cmd, opts, data) -> ( (out, err, fileName) := runGfanCommandCaptureBoth(cmd, opts, data); err ) --------------------------------------------------- -- Information on functions and arguments -------------------------------------------------- -- Check capitalization -- This is a list of which arguments are used for which function. -- Currently this is not used. argFuncs = { "d" => {gfanRenderStaircase, gfanTropicalStartingCone, gfanTropicalLinearSpace, gfanOverIntegers}, "e" => {gfan}, "g" => {gfan,gfanBuchberger,gfanTropicalStartingCone}, "h" => {gfanToLatex,gfanTropicalBasis}, "i" => {gfanHomogenize}, "m" => {gfanLeadingTerms,gfanRenderStaircase, gfanOverIntegers}, "n" => {gfanTropicalLinearSpace}, "L" => {gfanRender}, "r" => {gfanBuchberger}, "s" => {gfanPolynomialSetUnion}, "w" => {gfanBuchberger,gfanHomogenize,gfanRenderStaircase}, "W" => {gfanBuchberger}, "asfan" => {gfanGroebnerCone}, "disableSymmetryTest" => {gfan}, --missing help "ideal" => {gfanInitialForms}, "initialIdeal" => {gfanOverIntegers}, "groebnerBasis" => {gfanOverIntegers}, "groebnerFan" =>{gfanOverIntegers}, "noincidence" => {gfanTropicalTraverse}, "pair" => {gfanGroebnerCone, gfanInitialForms}, "polynomialset" => {gfanToLatex}, "polynomialsetlist" => {gfanToLatex}, "projection" => {gfanResultantFan, gfanTropicalHyperSurfaceReconstruction}, -- v0.6 "restrict" => {gfanGroebnerCone,gfanToPolyhedralFan}, "shiftVariables" => {gfanRender}, "special" => {gfanResultantFan}, -- "subspace" => {gfan}, -- missing v0.4 "stable" => {gfanTropicalStartingCone, gfanTropicalTraverse}, "symmetry" => {gfan,gfanTropicalTraverse,gfanToPolyhedralFan}, "tplane" => {gfanTropicalIntersection}, "symmetryExploit" => {gfanTropicalIntersection}, "tropicalbasistest" => {gfanTropicalIntersection}, } -- Fix capitalization -- This converts the macaulay 2 argument names to gfan argument names argStrs = hashTable { "d" => "-d", "e" => "-e", "g" => "-g", "h" => "-h", "i" => "-i", "i1" => "-i1", "i2" => "-i2", "j" => "-j", "L" => "-L", "m" => "-m", "n" => "-n", "M2" => "-M2", "r" => "-r", "s" => "-s", "t" => "-t", "w" => "-w", "W" => "-W", "asfan" => "--asfan", "disableSymmetryTest" => "--disableSymmetryTest", "dressian" => "--dressian", "help" => "--help", "ideal" => "--ideal", "initialIdeal" => "--initialIdeal", "groebnerBasis" => "--groebnerBasis", "groebnerFan" => "--groebnerFan", "kapranov" => "--kapranov", "mark" => "--mark", "names" => "--names", "nocones" => "--nocones", "noincidence" => "--noincidence", "pair" => "--pair", "pluckersymmetries" => "--pluckersymmetries", "polynomialset" => "--polynomialset_", "polynomialsetlist" => "--polynomialsetlist_", "projection" => "--projection", "restrict" => "--restrict", "scale" => "--scale", "shiftVariables" => "--shiftVariables", "special" => "--special", "star" => "--star", "stable" => "--stable", "symmetry" => "--symmetry", "symmetryExploit" => "--symmetryExploit", "symmetryPrinting" => "--symmetryPrinting", "symsigns" => "--symsigns", -- "subspace" => "--subspace", -- missing in v0.4 "tplane" => "--tplane", "trees" => "--trees", "unimodular" => "--unimodular", "vectorinput" => "--vectorinput", "xml" => "--xml", "tropicalbasistest" => "--tropicalbasistest" }; --------------------------------------------------------- -- cmdLineArgs -- Describes which functions have command line arguments -- that take values on the command line and not on stdin. -- Used by gfanArgumentToString --------------------------------------------------------- cmdLineArgs = hashTable { "gfan _render" => { "shiftVariables" }, "gfan _renderstaircase" => { "d", "w" }, "gfan _fancommonrefinement" => {"i1", "i2"}, "gfan _fancommonrefinement --stable" => {"i1", "i2"}, "gfan _fanlink" => {"i"}, "gfan _fanproduct" => {"i1", "i2"}, "gfan _minors" => {"r", "d", "n"}, "gfan _mixedvolume" => {"j"}, "gfan _tropicallinearspace" => {"n", "d"}, "gfan _tropicalhypersurfacereconstruction" => {"i"} } -------------------------------------------------------- -------------------------------------------------------- -- GFAN HOOKS START HERE -------------------------------------------------------- -------------------------------------------------------- -------------------------------------------------------- -- gfan -------------------------------------------------------- gfan = method( Options => { "g" => false, "symmetry" => null, "e" => false, "disableSymmetryTest" => false } ) gfan Ideal := opts -> (I) -> ( (ringMap, newI) := gfanConvertToNewRing(I); I = newI; if opts#"g" then error "Polynomials must be marked for the -g option"; input := gfanRingToString(ring I) | gfanIdealToString(I) | gfanVectorListToString(opts#"symmetry"); LMPL := gfanParseLMPL first runGfanCommand("gfan _bases", opts, input); gfanRevertToOriginalRing(LMPL, ringMap) ) gfan MarkedPolynomialList := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanMPLToRingToString(L) | gfanMPLToString(L) | gfanVectorListToString(opts#"symmetry"); LMPL := gfanParseLMPL first runGfanCommand("gfan _bases", opts, input); gfanRevertToOriginalRing(LMPL, ringMap) ) gfan List := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; if opts#"g" then error "Polynomials must be marked for the -g option"; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L) | gfanVectorListToString(opts#"symmetry"); LMPL := gfanParseLMPL first runGfanCommand("gfan _bases", opts, input); gfanRevertToOriginalRing(LMPL, ringMap) ) -------------------------------------------------------- -- MPLConverter -------------------------------------------------------- MPLConverter = method(Options=>{}) MPLConverter List := opts -> (L) -> ( input := List ; markedPolynomialList{flatten entries leadTerm gens ideal L, flatten entries gens ideal L} ) MPLConverter Ideal := opts -> (I) -> ( markedPolynomialList{flatten entries leadTerm gens I, flatten entries gens I} ) -------------------------------------------------------- -- gfan_buchberger -------------------------------------------------------- gfanBuchberger = method( Options => { "w"=>null, "r"=>false, "W"=>false, "g"=>false } ) gfanBuchberger List := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L) | gfanIntegerListToString(opts#"w"); MPL := gfanParseMPL first runGfanCommand("gfan _buchberger", opts, input); gfanRevertToOriginalRing(MPL, ringMap) ) gfanBuchberger Ideal := opts -> (I) -> ( gfanBuchberger(flatten entries gens I, opts) ) gfanBuchberger MarkedPolynomialList := opts -> (L) -> ( gfanBuchberger(last L, opts) ) -------------------------------------------------------- -- gfan_doesidealcontain -------------------------------------------------------- gfanDoesIdealContain = method(Options=>{}) gfanDoesIdealContain (MarkedPolynomialList, List) := opts -> (I,J) -> ( (ringMap, newJ) := gfanConvertToNewRing(J); J = newJ; (ringMap2, newI) := gfanConvertToNewRing(I,ringMap); I = newI; input := gfanMPLToRingToString(I) | gfanMPLToString(I) | gfanPolynomialListToString(J); gfanParseBoolInteger first runGfanCommand("gfan _doesidealcontain", opts, input) ) gfanDoesIdealContain (Ideal, List) := opts -> (I,J) -> ( gfanDoesIdealContain(MPLConverter(I), J, opts) ) gfanDoesIdealContain (List, List) := opts -> (I,J) -> ( gfanDoesIdealContain(MPLConverter(I), J, opts) ) -------------------------------------------------------- -- gfan_fancommonrefinement -------------------------------------------------------- gfanFanCommonRefinement = method( Options => { "i1" => null, -- these are set inside the method "i2" => null -- these are set inside the method } ) --This has been broken by our changes to gfanInterface to make --the output be Fans in the new sense. gfanFanCommonRefinement (Fan, Fan) := opts -> (F,G) -> ( fileF := ""; fileG := ""; fileFisTemp := true; fileGisTemp := true; -- if F#?"GfanFileName" and fileExists F#"GfanFileName" then -- (fileF = F#"GfanFileName"; fileFisTemp = false;) -- else if F#?"GfanFileRawString" then -- fileF = gfanMakeTemporaryFile F#"GfanFileRawString" -- else fileF = gfanMakeTemporaryFile toPolymakeFormat F; if G#?"GfanFileName" and fileExists G#"GfanFileName" then (fileG = G#"GfanFileName"; fileGisTemp = false;) else if G#?"GfanFileRawString" then fileG = gfanMakeTemporaryFile G#"GfanFileRawString" else fileG = gfanMakeTemporaryFile toPolymakeFormat G; opts = opts ++ { "i1" => fileF , "i2" => fileG }; out := gfanParsePolyhedralFan runGfanCommand("gfan _fancommonrefinement", opts, ""); if gfanKeepFiles then ( F#"GfanFileName" = fileF; G#"GfanFileName" = fileG; ) else ( if fileFisTemp then gfanRemoveTemporaryFile fileF; if fileGisTemp then gfanRemoveTemporaryFile fileG; ); out ) --Stable intersection is currently an option of gfan_fancommonrefinement --We're making it a separate function as that may change gfanStableIntersection = method( Options=> { "i1" => null, -- these are set inside the method "i2" => null -- these are set inside the method } ) gfanStableIntersection (Fan,List,Fan,List) := opts -> (F,m1,G,m2) -> ( fileF := ""; fileG := ""; -- fileFisTemp := false; -- fileGisTemp := false; fileF = gfanMakeTemporaryFile( (toPolymakeFormat(F))| toPolymakeFormat("MULTIPLICITIES",m1)); fileG = gfanMakeTemporaryFile( (toPolymakeFormat(G))| toPolymakeFormat("MULTIPLICITIES",m2)); opts = opts ++ { "i1" => fileF , "i2" => fileG }; out := runGfanCommand("gfan _fancommonrefinement --stable", opts, ""); if (#select("empty",out#0)==1) then return "error: this fan is empty"; if (length(out#0)==0) then return "error: this fan is empty"; out = gfanParsePolyhedralFan out; if gfanKeepFiles then ( F#"GfanFileName" = fileF; G#"GfanFileName" = fileG; ) else ( -- if fileFisTemp then gfanRemoveTemporaryFile fileF; -- if fileGisTemp then gfanRemoveTemporaryFile fileG; ); out ) -------------------------------------------------------- -- gfan_fanlink -------------------------------------------------------- gfanFanLink = method( Options => { "i" => null, -- this is set inside the method "symmetry" => null, "star" => false } ) gfanFanLink (Fan, List) := opts -> (F,V) -> ( input := gfanIntegerListToString V; fileName := ""; fileIsTemp := true; if F#?"GfanFileName" and fileExists F#"GfanFileName" then (fileName = F#"GfanFileName"; fileIsTemp = false;) else if F#?"GfanFileRawString" then fileName = gfanMakeTemporaryFile F#"GfanFileRawString" else fileName = gfanMakeTemporaryFile toPolymakeFormat F; opts = opts ++ { "i" => fileName }; out := gfanParsePolyhedralFan runGfanCommand("gfan _fanlink", opts, input); out=out_0; if gfanKeepFiles then F#"GfanFileName" = fileName else if fileIsTemp then gfanRemoveTemporaryFile fileName; out ) -------------------------------------------------------- -- gfan_fanproduct -------------------------------------------------------- gfanFanProduct = method( Options => { "i1" => null, "i2" => null } ) -- Set to null because they are set inside the method -- version 0.4 gfanFanProduct (Fan, Fan) := opts -> (F,G) -> ( fileF := ""; fileG := ""; -- if F#?"GfanFileName" and fileExists F#"GfanFileName" then -- (fileF = F#"GfanFileName"; fileFisTemp = false;) -- else if F#?"GfanFileRawString" then -- fileF = gfanMakeTemporaryFile F#"GfanFileRawString" -- else fileF = gfanMakeTemporaryFile toPolymakeFormat F; -- if G#?"GfanFileName" and fileExists G#"GfanFileName" then -- (fileG = G#"GfanFileName"; fileGisTemp = false;) -- else if G#?"GfanFileRawString" then -- fileG = gfanMakeTemporaryFile G#"GfanFileRawString" -- else fileG = gfanMakeTemporaryFile toPolymakeFormat G; opts = opts ++ { "i1" => fileF , "i2" => fileG }; out := gfanParsePolyhedralFan runGfanCommand("gfan _fanproduct", opts, ""); if gfanKeepFiles then ( F#"GfanFileName" = fileF; G#"GfanFileName" = fileG; ) else ( gfanRemoveTemporaryFile fileF; gfanRemoveTemporaryFile fileG; ); out ) -------------------------------------------------------- -- gfan_groebnercone -------------------------------------------------------- gfanGroebnerCone = method( Options => { "restrict" => false, "pair" => false, "asfan" => true, "xml" => false, "vectorinput" => false } ) gfanGroebnerCone (MarkedPolynomialList, MarkedPolynomialList) := opts -> (L,M) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; (ringMap2, newM) := gfanConvertToNewRing(M, ringMap); M = newM; if not opts#"pair" then ( if gfanVerbose then << "Using --pair option for gfanGroebnerCone." << endl; opts = opts ++ {"pair" => true}; ); if gfanMPLToRingToString(L) != gfanMPLToRingToString(M) then ( error("The arguments to gfanGroebnerCone should be defined over the same ring."); ); input := gfanMPLToRingToString(L) | gfanMPLToString(L) | gfanMPLToString(M); gfanParsePolyhedralFan runGfanCommand("gfan _groebnercone", opts, input) ) gfanGroebnerCone (Ideal, Ideal) := opts -> (I,J) -> ( gfanGroebnerCone(MPLConverter(I), MPLConverter(J), opts) ) gfanGroebnerCone (List, List) := opts -> (L,M) -> ( gfanGroebnerCone(MPLConverter(L), MPLConverter(M), opts) ) gfanGroebnerCone (Ideal, List) := opts -> (I,L) -> ( gfanGroebnerCone(MPLConverter(I), MPLConverter(L), opts) ) gfanGroebnerCone (List, Ideal) := opts -> (L,I) -> ( gfanGroebnerCone(MPLConverter(L), MPLConverter(I), opts) ) gfanGroebnerCone (MarkedPolynomialList, Ideal) := opts -> (M,I) -> ( gfanGroebnerCone(M, MPLConverter(I), opts) ) gfanGroebnerCone (Ideal, MarkedPolynomialList) := opts -> (I,M) -> ( gfanGroebnerCone(MPLConverter(I), M, opts) ) gfanGroebnerCone (MarkedPolynomialList, List) := opts -> (M,L) -> ( gfanGroebnerCone(M, MPLConverter(L), opts) ) gfanGroebnerCone (List, MarkedPolynomialList) := opts -> (L,M) -> ( gfanGroebnerCone(MPLConverter(L), M, opts) ) gfanGroebnerCone Ideal := opts -> (I) -> ( gfanGroebnerCone(MPLConverter(I), opts) ) --The bug in this one is that gfanParsePolyhedralFan assumes that it is trying --to create a fan, but this should be a cone (i.e, the gfan output doesn't have rays -- To continue to debug, make it print input -- and give that to gfan directly to help. -- Still a bug! gfanGroebnerCone MarkedPolynomialList := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; if opts#"pair" then error("The pair option for gfanGroebnerCone should be used along with " | "two MarkedPolynomialLists as arguments."); input := gfanMPLToRingToString(L) | gfanMPLToString(L); gfanParsePolyhedralFan runGfanCommand("gfan _groebnercone", opts, input) ) gfanGroebnerCone Ideal := opts -> (I) -> ( gfanGroebnerCone(MPLConverter(I), opts) ) gfanGroebnerCone List := opts -> (L) -> ( gfanGroebnerCone(MPLConverter(L), opts) ) -------------------------------------------------------- -- gfan_homogeneityspace -------------------------------------------------------- --The bug here is the same as for Groebner cone - the output -- should be a cone, not a fan (and it comes from gfan as a PolyhedralCone) --Still a bug!!! gfanHomogeneitySpace = method(Options=>{}) gfanHomogeneitySpace (List) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L); gfanParsePolyhedralFan runGfanCommand("gfan _homogeneityspace", opts, input) ) gfanHomogeneitySpace (MarkedPolynomialList) := opts -> (L) -> ( gfanHomogeneitySpace(last L) ) gfanHomogeneitySpace Ideal := opts -> (I) -> ( gfanHomogeneitySpace(MPLConverter(I), opts) ) -------------------------------------------------------- -- gfan_homogenize -------------------------------------------------------- gfanHomogenize = method( Options => { "i"=>false, "w"=>false } ) gfanHomogenize (List, Symbol) := opts -> (L,X) -> ( input := gfanRingToString(ring first L) | gfanPolynomialListToString(L) | gfanSymbolToString(X) | gfanIntegerListToString(opts#"w"); out := first runGfanCommand("gfan _homogenize", opts, input); R := ring first L; -- S := R[X]; S := (coefficientRing R)[gens R | {X}]; gfanParseIdeal(out) ) gfanHomogenize (MarkedPolynomialList, Symbol) := opts -> (L,X) -> ( input := gfanMPLToRingToString(L) | gfanMPLToString(L) | gfanSymbolToString(X) | gfanIntegerListToString(opts#"w"); out := first runGfanCommand("gfan _homogenize", opts, input); R := ring first first L; -- S := R[X]; S := (coefficientRing R)[gens R | {X}]; gfanParseMPL(out) ) gfanHomogenize (Ideal, Symbol) := opts -> (I,X) -> ( gfanHomogenize(MPLConverter(I), X, opts) ) -------------------------------------------------------- -- gfan_initialforms -------------------------------------------------------- --Dear Mike: --If --ideal is used, does the output need to be marked? Note, it is a GB wrt W. --Does --pair make sense without --ideal? Probably not. --Does --pair and --ideal need to be marked? I would assume so. --So, is no --pair and no --ideal the only case where the output is not marked? --Hey! Version 0.4 clarifies this. gfanInitialForms = method( Options => { "ideal" => false, "pair" => false, "mark" => false } ) gfanInitialForms (List, List) := opts -> (L,W) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L) | gfanIntegerListToString(W); if opts#"pair" then out := gfanParseIdealPair first runGfanCommand("gfan _initialforms", opts, input) else out = gfanParseIdeal first runGfanCommand("gfan _initialforms", opts, input); gfanRevertToOriginalRing(out,ringMap) ) gfanInitialForms (MarkedPolynomialList, List) := opts -> (L,W) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanMPLToRingToString(L) | gfanMPLToString(L) | gfanIntegerListToString(W); if opts#"pair" then out := gfanParseMPLPair first runGfanCommand("gfan _initialforms", opts, input) else out = gfanParseMPL first runGfanCommand("gfan _initialforms", opts, input); gfanRevertToOriginalRing(out, ringMap) ) gfanInitialForms (Ideal, List) := opts -> (I,L) -> ( gfanInitialForms(flatten entries gens I, L, opts) ) -------------------------------------------------------- -- gfan_interactive -------------------------------------------------------- gfanInteractive = method( Options => {} ) gfanInteractive := opts -> () -> ( error "Not implemented"; ) -------------------------------------------------------- -- gfan_ismarkedgroebnerbasis -------------------------------------------------------- gfanIsMarkedGroebnerBasis = method( Options => {} ) gfanIsMarkedGroebnerBasis (MarkedPolynomialList) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanMPLToRingToString(L) | gfanMPLToString(L); gfanParseBool first runGfanCommand("gfan _ismarkedgroebnerbasis", opts, input) ) gfanIsMarkedGroebnerBasis (Ideal) := opts -> (I) -> ( gfanIsMarkedGroebnerBasis(MPLConverter(I), opts) ) gfanIsMarkedGroebnerBasis (List) := opts -> (L) -> ( gfanIsMarkedGroebnerBasis(MPLConverter(L), opts) ) -------------------------------------------------------- -- gfan_krulldimension -------------------------------------------------------- gfanKrullDimension = method( Options => {} ) gfanKrullDimension (MarkedPolynomialList) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanMPLToRingToString(L) | gfanMPLToString(L); gfanParseInteger first runGfanCommand("gfan _krulldimension", opts, input) ) gfanKrullDimension (Ideal) := opts -> (I) -> ( gfanKrullDimension(MPLConverter(I), opts) ) gfanKrullDimension (List) := opts -> (L) -> ( gfanKrullDimension(MPLConverter(L), opts) ) -------------------------------------------------------- -- gfan_latticeideal -------------------------------------------------------- gfanLatticeIdeal = method( Options => { "t" => false } ) gfanLatticeIdeal (List) := opts -> (L) -> ( input := gfanVectorListToString L; QQ[(getSymbol("x"))_0..(getSymbol("x"))_(#(first L)-1)]; gfanParseIdeal replace("x", "x_", first runGfanCommand("gfan _latticeideal", opts, input)) ) -------------------------------------------------------- -- gfan_leadingterms -------------------------------------------------------- gfanLeadingTerms = method( Options => { "m" => false } ) gfanLeadingTerms (MarkedPolynomialList) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; if opts#"m" then ( error "gfanLeadingTerms: Expected a list of MarkedPolynomialLists with the -m option."; ) else ( input := gfanMPLToRingToString(L) | gfanMPLToString(L); I := gfanParseIdeal first runGfanCommand("gfan _leadingterms", opts, input); return gfanRevertToOriginalRing(I, ringMap); ) ) gfanLeadingTerms (List) := opts -> (L) -> ( if opts#"m" then ( input := gfanMPLToRingToString(first L) | gfanLMPLToString(L); return gfanParseIdeals first runGfanCommand("gfan _leadingterms", opts, input); ) else ( error "gfanLeadingTerms: Expected a MarkedPolynomialList when -m is not used."; ) ) -------------------------------------------------------- -- gfan_markpolynomialset -------------------------------------------------------- gfanMarkPolynomialSet = method( Options => {} ) gfanMarkPolynomialSet (List, List) := opts -> (L,W) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L) | gfanIntegerListToString(W); MI := gfanParseMarkedIdeal first runGfanCommand("gfan _markpolynomialset", opts, input); gfanRevertToOriginalRing(MI, ringMap) ) -------------------------------------------------------- -- gfan_minkowskisum -------------------------------------------------------- gfanMinkowskiSum = method( Options => { "symmetry" => null, "disableSymmetryTest" => false, "nocones" => false } ) gfanMinkowskiSum (List) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L); gfanParsePolyhedralFan runGfanCommand("gfan _minkowskisum", opts, input) ) gfanMinkowskiSum (Ideal) := opts -> (I) -> ( gfanMinkowskiSum(MPLConverter(I), opts) ) -------------------------------------------------------- -- gfan_minors -------------------------------------------------------- gfanMinors = method( Options => { "r" => null, "d" => null, "n" => null, "M2" => false, "names" => null, "dressian" => false, "pluckersymmetries" => false } ) gfanMinors (ZZ,ZZ,ZZ) := opts -> (r,d,n) -> ( input := ""; opts = opts ++ { "r" => r, "d" => d, "n" => n}; out := null; if opts#"dressian" then ( out = first runGfanCommand("gfan _minors", opts, input); QQ[apply(subsets(toList(0..n-1), d), ind -> (getSymbol("p"))_(concatenate(ind/toString)))]; out = replace("p(.{"| d | "," | d | "})", "p_\"\\1\"", out); return gfanParseIdeal out; ) else if opts#"pluckersymmetries" then ( return value replace("\\}\n\\{", ",", first runGfanCommand("gfan _minors", opts, input)); ) else ( out = first runGfanCommand("gfan _minors", opts, input); QQ[flatten apply(d, i -> apply(n, j -> (getSymbol("m"))_(""|i|j)))]; out = replace("m(..)", "m_\"\\1\"", out); return gfanParseIdeal out; ) ) -------------------------------------------------------- -- gfan_overintegers -------------------------------------------------------- gfanOverIntegers = method( Options => { "groebnerFan" => false, "initialIdeal" => false, "groebnerBasis" => false } ) gfanOverIntegers Ideal := opts -> (I) -> ( if not opts#"groebnerFan" then error "Must specify groebnerFan or give weight vector."; input := gfanRingToRationalString(ring I) | gfanIdealToString(I); resultString := first runGfanCommand("gfan _overintegers", opts, input); return gfanParsePolyhedralFan resultString; ) gfanOverIntegers (Ideal, List) := opts -> (I, w) -> ( if opts#"groebnerFan" then ( << "Ignoring groebnerFan."; ); if opts#"initialIdeal" and opts#"groebnerBasis" then error "Two procedures specified"; if not opts#"initialIdeal" and not opts#"groebnerBasis" then error "Must specify a procedure."; input := gfanRingToRationalString(ring I) | gfanIdealToString(I) | gfanIntegerListToString(w); resultString := first runGfanCommand("gfan _overintegers", opts, input); if opts#"initialIdeal" then( return gfanParseIdeal resultString; ) else ( return gfanParseMPL resultString; ) ) -- This function is used as gfan_overintegers requires the polynomial ring to be over -- a field, but it does not make sense for the rest of the program to have this. convertRingToRational = method() convertRingToRational Ring := ZRing -> ( if coefficientRing(ZRing) =!= ZZ then error "Must be a polynomial ring over integers"; return QQ(monoid[gens ZRing]); ) -- Takes a ring and returns a gfan string with rational coefficients. gfanRingToRationalString = method() gfanRingToRationalString Ring := ZRing -> ( out := "Q" | gfanToExternalString(new Array from gens ZRing) | newline; return out; ) -- Polyhedra wants fans to be constructed from the maximal cones. -- May be a way of doing this where we cut down on the cones we are iterating over. maximalConesFromList = method() maximalConesFromList List := cones -> ( maximalCones := cones; for index1 from 0 to #cones-1 do ( for index2 from 0 to #cones-1 do( if index1 === index2 then continue; if isSubset(cones#index2, cones#index1) then ( maximalCones = delete(cones#index2, maximalCones); ) ); ); return maximalCones; ) ------------------------------ -- gfan_mixedvolume -------------------------------------------------------- gfanMixedVolume = method( Options => { "j" => 1 --Number of threads used } ) gfanMixedVolume (List) := opts -> (L) -> ( if #L == 0 then return; L = (gfanConvertToNewRing(L))#1; input := gfanRingToString(ring L#0) | gfanPolynomialListToString(L); (runGfanCommand("gfan _mixedvolume", opts, input))#0 ) -------------------------------------------------------- -- gfan_polynomialsetunion -------------------------------------------------------- --Should this be marked? gfanPolynomialSetUnion = method( Options => { "s"=>false } ) gfanPolynomialSetUnion (MarkedPolynomialList,MarkedPolynomialList) := opts -> (L,K) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; (ringMap2, newK) := gfanConvertToNewRing(K, ringMap); K = newK; input := gfanMPLToRingToString(L) | gfanLMPLToString({L,K}); MI := gfanParseMarkedIdeal first runGfanCommand("gfan _polynomialsetunion", opts, input); gfanRevertToOriginalRing(MI,ringMap) ) gfanPolynomialSetUnion (List, List) := opts -> (L,M) -> ( gfanPolynomialSetUnion(MPLConverter(L), MPLConverter(M), opts) ) gfanPolynomialSetUnion (MarkedPolynomialList, List) := opts -> (M,L) -> ( gfanPolynomialSetUnion(M, MPLConverter(L), opts) ) gfanPolynomialSetUnion (List, MarkedPolynomialList) := opts -> (L,M) -> ( gfanPolynomialSetUnion(MPLConverter(L), M, opts) ) -------------------------------------------------------- -- gfan_render -------------------------------------------------------- runfig2dev = fileName -> ( if fig2devProgram === null then fig2devProgram = findProgram("fig2dev", "fig2dev -V"); runProgram(fig2devProgram, "-Lpng " | fileName | ".fig " | fileName | ".png"); ) gfanRender = method( Options => { "L" => false, "shiftVariables" => 0 } ) gfanRender (List) := opts -> (L) -> ( fileName := temporaryFileName(); gfanRender(fileName, L, opts); ) gfanRender (String, List) := opts -> (fileName, L) -> ( input := gfanMPLToRingToString(first L) | gfanLMPLToString(L); out := first runGfanCommand("gfan _render", opts, input); figure := openOut(fileName | ".fig"); figure << out << close; << "Figure rendered to " << fileName << ".fig" << endl; runfig2dev fileName; << "Figure converted to png: " << fileName << ".png" << endl; show URL("file://" | fileName | ".png"); ) -------------------------------------------------------- -- gfan_renderstaircase -------------------------------------------------------- gfanRenderStaircase = method( Options=> { "m"=>false, "d"=>8, "w"=>5 } ) gfanRenderStaircase (List) := opts -> (L) -> ( gfanRenderStaircase(temporaryFileName(), L, opts); ) gfanRenderStaircase (String, List) := opts -> (fileName, L) -> ( out := if opts#"m" then first runGfanCommand("gfan _renderstaircase", opts, gfanMPLToRingToString(first L) | gfanLMPLToString(L) | "\n") else first runGfanCommand("gfan _renderstaircase", opts, gfanMPLToRingToString(L) | gfanMPLToString(L) | "\n"); figure := openOut(fileName | ".fig"); figure << out << close; << "Figure rendered to " << fileName << ".fig" << endl; runfig2dev fileName; << "Figure converted to png: " << fileName << ".png" << endl; show URL("file://" | fileName | ".png"); ) -------------------------------------------------------- -- gfanResultantFan -------------------------------------------------------- gfanResultantFan = method(Options => { "vectorinput"=>true, "special"=> null } ) gfanResultantFan (List) := opts -> (tuple) -> ( type := PolynomialRing; if (tuple !={}) then ( if (not same(tuple/class)) then error "All elements in the list should be of the same class\n"; type= class class(tuple#0); ); vectorConfiguration := tuple; if(type===PolynomialRing) then vectorConfiguration = tuple/exponents; inPut := gfanVectorListListToString(vectorConfiguration)|gfanVectorToString(opts#"special"); gfanParsePolyhedralFan runGfanCommand("gfan _resultantfan", opts, inPut) ) -------------------------------------------------------- -- gfan_saturation -------------------------------------------------------- gfanSaturation = method( Options => { "h" => false } ) gfanSaturation (Ideal) := opts -> (I) -> ( (ringMap, newI) := gfanConvertToNewRing(I); I = newI; input := gfanRingToString(ring I) | gfanIdealToString(I); I = gfanParseIdeal first runGfanCommand("gfan _saturation", opts, input); gfanRevertToOriginalRing(I, ringMap) ) -------------------------------------------------------- -- gfan_secondaryfan -------------------------------------------------------- gfanSecondaryFan = method( Options => { "unimodular" => false, "scale" => null, "symmetry" => null } ) gfanSecondaryFan (List) := opts -> (L) -> ( --version 0.4 input := gfanVectorConfigToString L; gfanParsePolyhedralFan runGfanCommand("gfan _secondaryfan", opts, input) ) -------------------------------------------------------- -- gfan_stats -------------------------------------------------------- gfanStats = method( Options => {} ) gfanStats (List) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanMPLToRingToString(first L) | gfanLMPLToString(L); first runGfanCommand("gfan _stats", opts, input) -- Parse this? ) -------------------------------------------------------- -- gfan_substitute -------------------------------------------------------- gfanSubstitute = method( Options => {} ) gfanSubstitute (MarkedPolynomialList, PolynomialRing) := opts -> (L,R) -> ( input := gfanMPLToRingToString(L) | gfanMPLToString(L) | gfanRingToString(R); use R; gfanParseMarkedIdeal first runGfanCommand("gfan _substitute", opts, input) ) gfanSubstitute (Ideal, PolynomialRing) := opts -> (I,R) -> ( gfanSubstitute(MPLConverter(I), R, opts) ) gfanSubstitute (List, PolynomialRing) := opts -> (L,R) -> ( gfanSubstitute(MPLConverter(L), R, opts) ) -------------------------------------------------------- -- gfan_tolatex -------------------------------------------------------- gfanToLatex = method( Options => { "h" => false, "polynomialset" => false, "polynomialsetlist" => false } ) gfanToLatex (List) := opts -> (L) -> ( if opts#?"polynomialset" and opts#"polynomialset" then ( return first runGfanCommand("gfan _tolatex", opts, gfanMPLToString(L)); ) else ( if not (opts#?"polynomialsetlist" and opts#"polynomialsetlist") then opts = opts ++ { "polynomialsetlist" => true }; return first runGfanCommand("gfan _tolatex", opts, gfanLMPLToString(L)); ); ) gfanToLatex (MarkedPolynomialList) := opts -> (L) -> ( if not opts#"polynomialset" then opts = opts ++ { "polynomialset" => true }; return first runGfanCommand("gfan _tolatex", opts, gfanMPLToString(L)); ) -------------------------------------------------------- -- gfan_topolyhedralfan -------------------------------------------------------- gfanToPolyhedralFan = method( Options => { "restrict" => false, "symmetry" => null } ) gfanToPolyhedralFan List := opts -> (L) -> ( input := gfanMPLToRingToString(first L) | gfanVectorListToString(opts#"symmetry") | gfanLMPLToString(L); gfanParsePolyhedralFan runGfanCommand("gfan _topolyhedralfan", opts, input) ) -------------------------------------------------------- -- gfan_tropicalbasis -------------------------------------------------------- gfanTropicalBasis = method( Options => { "h"=>false } ) gfanTropicalBasis (Ideal) := opts -> (I) -> ( (ringMap, newI) := gfanConvertToNewRing(I); I = newI; input := gfanRingToString(ring I) | gfanIdealToString(I); I = gfanParseIdeal first runGfanCommand("gfan _tropicalbasis", opts, input);-- should this be marked? Probably not. gfanRevertToOriginalRing(I,ringMap) ) -------------------------------------------------------- -- gfan_tropicalbruteforce -------------------------------------------------------- gfanTropicalBruteForce = method( Options => {} ) gfanTropicalBruteForce List := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanMPLToRingToString(L) | gfanMPLToString(L); output := runGfanCommand("gfan _tropicalbruteforce", opts, input); --check if fan is empty if (#select("empty",output#0)==1) then return "error: this fan is empty"; --minmax switch disabled -- gfanParsePolyhedralFan append(output, "TropicalMinConventionApplies" => true) gfanParsePolyhedralFan output ) -------------------------------------------------------- -- gfan_tropicalevaluation -------------------------------------------------------- gfanTropicalEvaluation = method( Options => {} ) gfanTropicalEvaluation (RingElement, List) := opts -> (f,L) -> ( --v0.4 input := gfanRingToString(ring f) | gfanPolynomialListToString({f}) | gfanVectorListToString(L); value first runGfanCommand("gfan _tropicalevaluation", opts, input) -- Make/find a parsing function for the above ) -------------------------------------------------------- -- gfan_tropicalfunction -------------------------------------------------------- gfanTropicalFunction = method( Options => {} ) gfanTropicalFunction RingElement := opts -> (f) -> ( --v0.4 (ringMap, newf) := gfanConvertToNewRing(f); f = newf; input := gfanRingToString(ring f) | gfanPolynomialListToString{f}; gfanParsePolyhedralFan runGfanCommand("gfan _tropicalfunction", opts, input) ) -------------------------------------------------------- -- gfan_tropicalhypersurface -------------------------------------------------------- gfanTropicalHyperSurface = method( Options => {} ) gfanTropicalHyperSurface RingElement := opts -> (f) -> ( --v0.4 (ringMap, newf) := gfanConvertToNewRing(f); f = newf; input := gfanRingToString(ring f) | gfanPolynomialListToString{f}; gfanParsePolyhedralFan runGfanCommand("gfan _tropicalhypersurface", opts, input) ) -------------------------------------------------------- -- gfan_tropicalhypersurfacereconstruction-- v0.6 -------------------------------------------------------- gfanTropicalHyperSurfaceReconstruction = method( Options => { "i" => null, -- set inside the method "projection" => null} ) -- a list of vectors spanning the linear space to be added to the fan gfanTropicalHyperSurfaceReconstruction Fan := opts -> (F) -> ( input := gfanVectorListToString opts#"projection"; fileName := ""; fileIsTemp := true; if F#?"GfanFileName" and fileExists F#"GfanFileName" then (fileName = F#"GfanFileName"; fileIsTemp = false;) else if F#?"GfanFileRawString" then fileName = gfanMakeTemporaryFile F#"GfanFileRawString" else fileName = gfanMakeTemporaryFile toPolymakeFormat F; opts = opts ++ { "i" => fileName }; out := gfanParsePolyhedralFan runGfanCommand("gfan _tropicalhypersurfacereconstruction", opts, input) ; if gfanKeepFiles then F#"GfanFileName" = fileName else if fileIsTemp then gfanRemoveTemporaryFile fileName; out ) -------------------------------------------------------- -- gfan_tropicalintersection -------------------------------------------------------- gfanTropicalIntersection = method( Options => { "tropicalbasistest" => false, "tplane" => false, "symmetryPrinting" => false, "symmetryExploit" => false, "restrict" => false, "stable" => false } ) gfanTropicalIntersection (List) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L); s:=runGfanCommand("gfan _tropicalintersection", opts, input); tropicalBasisOutput:=s_0;--this is 0 if not tropical basis and 1 otherwise. if ((opts#"tropicalbasistest")==false) then (return gfanParsePolyhedralFan s) else if ((tropicalBasisOutput_0)=="0") then false else ( if (tropicalBasisOutput_0=="1") then true --In case something has changed in 'gfan' or 'gfanInterface' else error "Algorithm fail" ) ) gfanTropicalIntersection (List,List) := opts -> (L, symmetryList) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L) | gfanVectorListToString(symmetryList); s:=runGfanCommand("gfan _tropicalintersection", opts, input); tropicalBasisOutput:=s_0;--this is 0 if not tropical basis and 1 otherwise. if ((opts#"tropicalbasistest")==false) then (return gfanParsePolyhedralFan s) else if ((tropicalBasisOutput_0)=="0") then false else ( if (tropicalBasisOutput_0=="1") then true --In case something has changed in 'gfan' or 'gfanInterface' else error "Algorithm fail" ) ) -------------------------------------------------------- -- gfan_tropicallifting -------------------------------------------------------- gfanTropicalLifting = method( Options => {} ) gfanTropicalLifting := opts -> () -> ( error "Not implemented"; ) -------------------------------------------------------- -- gfan_tropicallinearspace -------------------------------------------------------- gfanTropicalLinearSpace = method( Options => { "trees" => false, "n" => null, "d" => null } ) gfanTropicalLinearSpace (List, ZZ, ZZ) := opts -> (L, n, d) -> ( --v0.4 opts = opts ++ { "n" => n , "d" => d}; input := (gfanIntegerListToString L) | "\n"; -- implicitly this accepts reals. It should be made explicit. R := QQ[getSymbol("t"), apply(n, i -> getSymbol("x"|i))]; (out, err, fileName) := runGfanCommandCaptureBoth("gfan _tropicallinearspace", opts, input); (gfanParseIdeal out, err) ) -------------------------------------------------------- -- gfan_tropicalmultiplicity -------------------------------------------------------- gfanTropicalMultiplicity = method( Options => {} ) gfanTropicalMultiplicity (List) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanMPLToRingToString(L) | gfanMPLToString(L); gfanParseInteger first runGfanCommand("gfan _tropicalmultiplicity", opts, input) ) -------------------------------------------------------- -- gfan_tropicalrank -------------------------------------------------------- gfanTropicalRank = method( Options => { "kapranov" => false } ) gfanTropicalRank (Matrix) := opts -> (M) -> ( --v0.4 input := gfanMatrixToString M; (out, err, fileName) :=runGfanCommandCaptureBoth("gfan _tropicalrank", opts, input); (gfanParseInteger out, err) ) -------------------------------------------------------- -- gfan_tropicalstartingcone -------------------------------------------------------- gfanTropicalStartingCone = method( Options => { "g" => false, "d" => false, "stable" => false } ) gfanTropicalStartingCone (List) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanRingToString(ring first L) | gfanPolynomialListToString(L); string := first runGfanCommand("gfan _tropicalstartingcone", opts, input); if (length(string) == 0) then return "error: this fan is empty"; MIP := gfanParseMarkedIdealPair string; if (instance(first flattenRecursive MIP,ZZ)) then return "error: this fan is empty"; gfanRevertToOriginalRing(MIP, ringMap) ) gfanTropicalStartingCone (Ideal) := opts -> (I) -> ( gfanTropicalStartingCone(flatten entries gens I, opts) ) -------------------------------------------------------- -- gfan_tropicaltraverse -------------------------------------------------------- gfanTropicalTraverse = method( Options => { "symmetry"=>null, "symsigns"=>false, "stable"=>false, "disableSymmetryTest"=>false, "nocones"=>false } ) gfanTropicalTraverse (List) := opts -> (L) -> ( (ringMap, newL) := gfanConvertToNewRing(L); L = newL; input := gfanMPLToRingToString(first L) | gfanMPLToString(first L) | gfanMPLToString(last L) | gfanVectorListToString(opts#"symmetry"); output := runGfanCommand("gfan _tropicaltraverse", opts, input); --check if the returned fan is empty if(length(output#0)==0) then return "error: this fan is empty"; --minmax switch disabled -- gfanParsePolyhedralFan append(output, "TropicalMinConventionApplies" => true ) gfanParsePolyhedralFan output ) -------------------------------------------------------- -- gfan_tropicalweildivisor -------------------------------------------------------- gfanTropicalWeilDivisor = method( Options => { "i1" => null, -- perhaps these should be removed "i2" => null } ) gfanTropicalWeilDivisor (Fan, Fan) := opts -> (F,G) -> ( --v0.4 fileF := ""; fileG := ""; fileFisTemp := true; fileGisTemp := true; if F#?"GfanFileName" and fileExists F#"GfanFileName" then (fileF = F#"GfanFileName"; fileFisTemp = false;) else if F#?"GfanFileRawString" then fileF = gfanMakeTemporaryFile F#"GfanFileRawString" else fileF = gfanMakeTemporaryFile toPolymakeFormat F; if G#?"GfanFileName" and fileExists G#"GfanFileName" then (fileG = G#"GfanFileName"; fileGisTemp = false;) else if G#?"GfanFileRawString" then fileG = gfanMakeTemporaryFile G#"GfanFileRawString" else fileG = gfanMakeTemporaryFile toPolymakeFormat G; opts = opts ++ { "i1" => fileF , "i2" => fileG }; out := gfanParsePolyhedralFan runGfanCommand("gfan _tropicalweildivisor", opts, ""); if gfanKeepFiles then ( F#"GfanFileName" = fileF; G#"GfanFileName" = fileG; ) else ( if fileFisTemp then gfanRemoveTemporaryFile fileF; if fileGisTemp then gfanRemoveTemporaryFile fileG; ); out ) -------------------------------------------------------- -- version -------------------------------------------------------- gfanVersion = () -> ( o := new OptionTable from {}; versionOutput := runGfanCommand("gfan _version", o, ); substring((separate ("\n", versionOutput#0))#1,4) ) -------------------------------------------------------- -- Documentation -------------------------------------------------------- -- documentation beginDocumentation() --Still to document: --gfanParsePolyhedralFan --gfanStableIntersection --gfanTropicalHyperSurfaceReconstruction --gfanVersion --multiplicitiesReorder (does this need to be exported?) --toPolymakeFormat (does this need to be exported?) gfanFunctions = hashTable { gfan => "gfan", gfanBuchberger => "gfan _buchberger", gfanDoesIdealContain => "gfan_doesidealcontain", gfanFanCommonRefinement => "gfan _fancommonrefinement", -- v0.4 gfanFanLink => "gfan _fanlink", -- v0.4 gfanFanProduct => "gfan _fanproduct", -- v0.4 gfanGroebnerCone => "gfan _groebnercone", gfanHomogeneitySpace => "gfan _homogeneityspace", gfanHomogenize => "gfan _homogenize", gfanInitialForms => "gfan _initialforms", gfanInteractive => "gfan _interactive", gfanIsMarkedGroebnerBasis => "gfan _ismarkedgroebnerbasis", gfanKrullDimension => "gfan _krulldimension", gfanLatticeIdeal => "gfan _latticeideal", -- v0.4 gfanLeadingTerms => "gfan _leadingterms", gfanMarkPolynomialSet => "gfan _markpolynomialset", gfanMinkowskiSum => "gfan _minkowskisum", -- v0.4 gfanMinors => "gfan _minors", -- v0.4 gfanOverIntegers => "gfan_overintegers", gfanMixedVolume => "gfan _mixedvolume", -- v0.6 gfanPolynomialSetUnion => "gfan _polynomialsetunion", gfanRender => "gfan _render", gfanRenderStaircase => "gfan _renderstaircase", gfanSaturation => "gfan _saturation", gfanSecondaryFan => "gfan _secondaryfan", -- v0.4 gfanStats => "gfan _stats", gfanSubstitute => "gfan _substitute", gfanToLatex => "gfan _tolatex", gfanToPolyhedralFan => "gfan _topolyhedralfan", gfanTropicalBasis => "gfan _tropicalbasis", gfanTropicalBruteForce => "gfan _tropicalbruteforce", gfanTropicalEvaluation => "gfan _tropicalevaluation", -- v0.4 gfanTropicalFunction => "gfan _tropicalfunction", -- v0.4 gfanTropicalHyperSurface => "gfan _tropicalhypersurface", -- v0.4 gfanTropicalIntersection => "gfan _tropicalintersection", gfanTropicalLifting => "gfan _tropicallifting", gfanTropicalLinearSpace => "gfan _tropicallinearspace", -- v0.4 gfanTropicalMultiplicity => "gfan _tropicalmultiplicity", gfanTropicalRank => "gfan _tropicalrank", -- v0.4 gfanTropicalStartingCone => "gfan _tropicalstartingcone", gfanTropicalTraverse => "gfan _tropicaltraverse", gfanTropicalWeilDivisor => "gfan _tropicalweildivisor" -- v0.4 } gfanHelp = functionStr -> PRE TT( if gfanProgram === null then gfanProgram = findProgram("gfan", "gfan --help", RaiseError => false); if gfanProgram =!= null then runGfanCommandCaptureError(functionStr, hashTable {"help" => true}, "") else {}) doc /// Key "gfanInterface" Headline a Macaulay2 interface to gfan Description Text @EM "gfanInterface"@ is an interface to Anders Jensen's Gfan software (available at @HREF "http://home.imf.au.dk/jensen/software/gfan/gfan.html"@), which is a C++ program to compute the Groebner fan (i.e. all the initial ideals) of an ideal. The main function in this package is @TO gfan@ which computes all of the Groebner bases and initial ideals of a given ideal. A useful feature of this function is that it can handle symmetries in the ideal. If you want the geometric information of this list of Groebner basis, see @TO gfanGroebnerCone@. Most of the functions in gfanInterface require @TO MarkedPolynomialList@ marked polynomial lists as input. In a marked polynomial list, the leading term of each polynomial is distinguished. New users should read the guide @TO "Conventions for calling methods with options"@. Since {\tt gfan} is distributed with @EM "Macaulay2"@, one rarely needs to consult the guide for @TO "Installation and Configuration of gfanInterface"@. Most of functions in the gfan package are accessible through this interface. If you wish to use one whose interface is not included here send a message to the package author. Also, please feel free to suggest changes to the parameter types and return types of each method. /// doc /// Key "Installation and Configuration of gfanInterface" Description Text The {\tt gfanInterface} package makes use of the binary executables from Anders Jensen's {\tt gfan} software package. These binary files are distributed with @EM "Macaulay2"@ (since version 1.3) and so, it is not necessary to install {\tt gfan} separately. The user can specify which {\tt gfan} executables are used by setting the appropriate key in the @TO "programPaths"@ hash table. When the path is unspecified, then the binaries provided by Macaulay2 are used, if present. If they are not present, then the directories specified in the user's {\tt PATH} environment variable are searched. You can change the path, if needed, by setting the appropriate key in @TO "programPaths"@ and loading the package: Example programPaths#"gfan" = "/directory/to/gfan/" loadPackage("gfanInterface", Reload => true) Text To set the path permanently, one needs to change {\tt gfanInterface.m2} either before installing or in the installed copy. You will find the path configuration near the top of the file. If {\tt gfanInterface} is already installed and loaded, you can find the path of the source file by the following command: Example gfanInterface#"source file" Text If you want to use {\tt gfan} executables outside of @EM "Macaulay2"@, they can be found with {\tt currentLayout#"programs"}: Example prefixDirectory | currentLayout#"programs" Text If you would like to see the input and output files used to communicate with {\tt gfan} you can set the {\tt "keepfiles"} configuration option to {\tt true}. If {\tt "verbose"} is set to {\tt true}, {\tt gfanInterface} will output the names of the temporary files used. Example loadPackage("gfanInterface", Configuration => { "keepfiles" => true, "verbose" => true}, Reload => true); QQ[x,y]; gfan {x,y}; Text Finally, if you want to be able to render Groebner fans and monomial staircases to {\tt .png} files, you should install {\tt fig2dev}. If it is installed in a non-standard location, then you may specify its path using @TO "programPaths"@. /// doc /// Key "Conventions for calling methods with options" Description Text In creating {\tt gfanInterface} the objective has been to mirror the {\tt gfan} commands as closely as possible in Macaulay 2. Many commands in {\tt gfan} allow command line options and these reproduced in {\tt gfanInterface} as optional arguments. For example, say we want to find the Groebner bases of an ideal with symmetry. From the command line, one would type @TT "gfan _bases --symmetry"@ and then give the ring, ideal and symmetries of the ideal as input. In {\tt gfanInterface} we pass the optional argument {\tt "symmetry"} the symmetries and provide the ideal as an argument. Example QQ[x,y,z]; gfan(ideal(x^2*y -z, y^2*z - x, z^2*x - y), "symmetry" => {{0,1,2}, {1,2,0}}) Text For each optional {\tt gfan} argument, the corresponding {\tt gfanInterface} argument is obtained by simply removing the dashes. Here's another example. If we run {\tt gfanBuchberger} without a weight vector, it will use the lexicographic order. Example QQ[x,y,z]; gfanBuchberger(ideal(x,y+z)) Text If we want to use a different order, the {\tt gfan} documentation tells us to use the {\tt -w} argument. So, in Macaulay 2, we set the {\tt w} argument to the desired weight vector. Example QQ[x,y,z]; gfanBuchberger(ideal(x,y+z), "w" => {1,2,3}) Text Many optional arguments to {\tt gfan} require no additional input. In this case, we set the optional argument in Macaulay 2 to be {\tt true}. /// doc /// Key "MarkedPolynomialList" Description Text A marked polynomial list is a list of polynomials in which the each polynomial has a distinguished term. In gfan, the leading terms of polynomials are marked by writing them first. For example, the leading term of @TEX "$y^2 + x^2 + z^2$"@ is @TEX "$y^2$"@ as it appears first. In Macaulay 2, polynomials are sorted based on the term order of the ring and so distinguished terms are lost if they do not correspond to the current ring's term order. Example QQ[x,y,z]; y^2 + x^2 + z^2 Text In {\tt gfanInterface}, we represent marked Groebner bases using a list of leading terms and a second list of polynomials. Such a pair of lists is made into a {\tt MarkedPolynomialList} by using the @TO markedPolynomialList@ constructor. Example QQ[x,y,z]; markedPolynomialList {{y^2, x^2}, {x^2 + y^2 + z^2, x^2 + y^2 + z^2}} Text Many methods in {\tt gfanInterface} require {\tt MarkedPolynomialLists} as input and produce them as output. For example, the method @TO gfanMarkPolynomialSet@ takes a list of polynomials and a weight vector and returns a list of marked polynomials. In this case, the leading term is first computed using the weight vector and then lexicographic order to break ties. Example QQ[x,y,z]; gfanMarkPolynomialSet({x*y^3+z^4, x^2*z^2 + y^3*z}, {-1,2,5}) SeeAlso markedPolynomialList /// doc /// Key markedPolynomialList Headline constructs a MarkedPolynomialList Usage L = markedPolynomialList P Inputs P:List of length two Outputs L:MarkedPolynomialList containing polynomials from the second entry of {\tt P} marked by the first entry of {\tt P} Description Text A marked polynomial list is a list of polynomials in which the each polynomial has a distinguished term. The input to {\tt markedPolynomialList} should be a list containing two lists: a list of marked terms and a list of polynomials to be marked. Example QQ[x,y,z]; polynomials = {x^2 + y^2 + z^2, y^2 + x^2 + z^2, y^2 + x^2 + z^2}; markedTerms = {x^2, y^2, z^2}; markedPolynomialList {markedTerms, polynomials} SeeAlso MarkedPolynomialList /// -- -- -- doc /// -- Key -- polymakeConeToCone -- (polymakeConeToCone, PolymakeCone) -- Headline -- converts a PolymakeCone into a Cone from the Polyhedra package -- Usage -- G = polymakeConeToCone F -- Inputs -- F:PolymakeCone -- Outputs -- G:Cone -- Description -- Text -- This method converts a @TO PolymakeCone@, as output by gfan, into a @TO Cone@ from the -- @TO Polyhedra@ package. -- Example -- R = QQ[x,y,z,w]; -- C = gfanGroebnerCone markedPolynomialList {{x*y*z}, { x*y*z + z*w^2*x + y^2*w*x}} -- G = polymakeConeToCone C -- rays G -- linSpace G -- SeeAlso -- polymakeFanToFan -- PolymakeFan -- PolymakeCone -- /// -- doc /// -- Key -- polymakeFanToFan -- (polymakeFanToFan, PolymakeFan) -- Headline -- converts a PolymakeFan into a Fan from the Polyhedra package -- Usage -- G = polymakeFanToFan F -- Inputs -- F:PolymakeFan -- Outputs -- G:Fan -- Description -- Text -- This method converts a @TO PolymakeFan@, as output by gfan, into a @TO Fan@ from the -- @TO Polyhedra@ package. -- Example -- R = QQ[x,y,z,w]; -- F = gfanToPolyhedralFan gfan { x*y -z, z*w - x} -- G = polymakeFanToFan F -- rays G -- linSpace G -- SeeAlso -- polymakeConeToCone -- PolymakeFan -- PolymakeCone -- /// doc /// Key gfan (gfan, Ideal) (gfan, List) (gfan, MarkedPolynomialList) Headline all reduced Groebner bases of a polynomial ideal Usage G = gfan(I) G = gfan(L) G = gfan(M) Inputs I:Ideal contained in a polynomial ring L:List of polynomials M:MarkedPolynomialList Outputs G:List all @TO2 {"Marked Groebner Basis Example", "marked reduced Groebner bases"}@ of {\tt I}, {\tt L}, or {\tt M} Description Text This method produces all reduced Groebner bases of a polynomial ideal. The ideal can be given as an {\tt Ideal}, {\tt List} of polynomials, or a {\tt MarkedPolynomialList}. The {\tt "g"=> true} option can be used to inform {\tt gfan} that the input is already a Groebner basis with respect to some monomial order. However, in this case, the input must be a {\tt MarkedPolynomialList}. Example R = QQ[x,y,z]; gfan(ideal(x^2*y -y^2, y^2*x - x^2)) gfan({x^2*y -y^2, y^2*x - x^2}, "symmetry" => {{0,1,2}, {1,0,2}}) gfan(markedPolynomialList {{y^5, x*y^2, x^2},{y^5-y^2,x*y^2 - y^4, x^2 -y^4}}, "g" => true) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan"@ /// doc /// Key MPLConverter (MPLConverter, List) (MPLConverter, Ideal) Headline Converts lists or ideals into markedPolynomialLists Usage G = MPLConverter{L} G = MPLConverter(I) Inputs L:List of polynomials I:Ideal contained in a polynomial ring Outputs G:MarkedPolynomialList a marked polynomial of {\tt I} Description Text This method converts ideals and lists into marked polynomial lists. The output is a {\tt MarkedPolynomialList}. The input can be given as an {\tt Ideal} or {\tt List} of polynomials. Example QQ[x,y]; I = ideal(x^2 + y^2, x*y + y^2 + y^3); MPLConverter(I) Example QQ[x,y]; MPLConverter{x^2 + y^2, x*y + y^2 + y^3} /// doc /// Key gfanBuchberger (gfanBuchberger, Ideal) (gfanBuchberger, List) (gfanBuchberger, MarkedPolynomialList) Headline reduced Groebner basis with respect to some monomial order Usage G = gfanBuchberger(I) G = gfanBuchberger(L) G = gfanBuchberger(M) Inputs I:Ideal contained in a polynomial ring L:List of polynomials M:MarkedPolynomialList Outputs G:MarkedPolynomialList a marked reduced Groebner basis of {\tt I} Description Text This method computes a reduced Groebner basis of an ideal with respect to the lexicographic order (by default) or with respect to some weight vector if option {\tt w} is specified. The output is a {\tt MarkedPolynomialList}. The input can be given as an {\tt Ideal}, {\tt List} of polynomials, or {\tt MarkedPolynomialList}. In the case of a {\tt MarkedPolynomialList}, the marked terms are ignored. Example QQ[x,y,z]; I = ideal(x*y + z, x*z + y); gfanBuchberger(I) gfanBuchberger(I, "w" => {1,2,3}) gfanBuchberger({x*y + z, x*z +y}, "w" => {1,2,3}) Text Note that Macaulay 2 can compute Groebner bases with respect to given weights without using gfan. Example QQ[x,y,z, MonomialOrder => { Weights => {1,2,3}, Lex } ]; G = gens gb ideal(x*y + z, x*z + y ) markedPolynomialList transpose apply(flatten entries G, g-> {leadTerm g, g}) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _buchberger"@ /// doc /// Key gfanDoesIdealContain (gfanDoesIdealContain, MarkedPolynomialList, List) (gfanDoesIdealContain, List, List) (gfanDoesIdealContain, Ideal, List) Headline check ideal membership by the division algorithm Usage B = gfanDoesIdealContain(M,K) B = gfanDoesIdealContain(L,K) B = gfanDoesIdealContain(I,K) Inputs M:MarkedPolynomialList a marked Groebner basis. L:List a list of Groebner basis. I:Ideal an ideal with Groebner basis as generator. K:List a list of polynomials Outputs B:Boolean true if every polynomial in {\tt K} belongs to the ideal generated by {\tt L} Description Text This method determines if a list of polynomials is contained in an ideal. The first input has to be in marked polynomial, in order to do this easily one could use gfanBuchberger as shown in the example as gfanBuchberger outputs a Groebner basis in as a markedPolynomialList. Macaulay 2 provides this functionality in the @TO isSubset@ method. Example QQ[x,y,z]; gfanDoesIdealContain(markedPolynomialList{{y*z,x*y,x*z}, {y*z, x*y - y, x*z + z}}, {x*y*z}) L=gfanBuchberger{x*y-y, x*z+z} gfanDoesIdealContain(L,{x*y*z}) isSubset(ideal(y*z), ideal(x*y - y, x*z +z)) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _doesidealcontain"@ /// doc /// Key gfanFanCommonRefinement (gfanFanCommonRefinement, Fan, Fan) Headline find the common refinement of two polyhedral fans Usage P = gfanFanCommonRefinement(F,G) Inputs F:Fan G:Fan Outputs P:Fan the common refinement of {\tt F} and {\tt G} Description Text This method takes two Fans and finds their common refinement. In the following, {\tt F} is the fan with two cones partitions the plane along the line @TEX "$y=x$"@ while {\tt G} has two cones that partition the plane along @TEX "$y = x/2$"@. The common refinement of these two fans is the fan of the four cones between these two lines. Example QQ[x,y]; F = gfanToPolyhedralFan gfan {x+y} G = gfanToPolyhedralFan gfan {x+y^2} gfanFanCommonRefinement(F,G) Text In the next example we take two half planes which overlap in the first quadrant. Their common refinement is simply their intersection. Example QQ[x,y]; --F = gfanToPolyhedralFan {markedPolynomialList{{x}, {x+y}}} --G = gfanToPolyhedralFan {markedPolynomialList{{y^2}, {x+y^2}}} --gfanFanCommonRefinement(F,G) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _fancommonrefinement"@ /// doc /// Key gfanFanLink (gfanFanLink, Fan, List) Headline the link of a vertex in a polyhedral fan Usage P = gfanFanLink(F, V) Inputs F:Fan a polyhedral fan V:List a vertex of the fan Outputs P:Fan the link of {\tt F} at {\tt V} Description Text This method computes the link of a polyhedral fan around a vertex. Example QQ[x,y]; F = gfanToPolyhedralFan {markedPolynomialList{{x}, {x+y}}}; G = gfanToPolyhedralFan {markedPolynomialList{{y^2}, {x+y^2}}}; --Q = gfanFanCommonRefinement(F,G) --gfanFanLink(Q, {2,1}, "star" =>true) --gfanFanLink(Q, {1,1}, "star" =>true) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _fanlink"@ /// doc /// Key gfanFanProduct (gfanFanProduct, Fan, Fan) Headline computes the product of polyhedral fans Usage P = gfanFanProduct(F,G) Inputs F:Fan a polyhedral fan G:Fan a polyhedral fan Outputs P:Fan the product of {\tt F} and {\tt G} Description Text This method computes the product of two polyhedral fans. The arguments {\tt i1} and {\tt i2} are automatically set. Example QQ[x,y]; F = gfanToPolyhedralFan {markedPolynomialList{{x}, {x+y}}} G = gfanToPolyhedralFan {markedPolynomialList{{y^2}, {x+y^2}}} gfanFanProduct(F,G) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _fanproduct"@ /// doc /// Key gfanGroebnerCone (gfanGroebnerCone, MarkedPolynomialList) (gfanGroebnerCone, List) (gfanGroebnerCone, Ideal) (gfanGroebnerCone, MarkedPolynomialList, MarkedPolynomialList) (gfanGroebnerCone, MarkedPolynomialList, List) (gfanGroebnerCone, MarkedPolynomialList, Ideal) (gfanGroebnerCone, Ideal, Ideal) (gfanGroebnerCone, Ideal, MarkedPolynomialList) (gfanGroebnerCone, Ideal, List) (gfanGroebnerCone, List, List) (gfanGroebnerCone, List, MarkedPolynomialList) (gfanGroebnerCone, List, Ideal) Headline polyhedral information about a Groebner cone Usage S = gfanGroebnerCone(M) S = gfanGroebnerCone(L) S = gfanGroebnerCone(I) S = gfanGroebnerCone(K, M) S = gfanGroebnerCone(K, L) S = gfanGroebnerCone(K, I) S = gfanGroebnerCone(N, M) S = gfanGroebnerCone(N, L) S = gfanGroebnerCone(N, I) S = gfanGroebnerCone(J, M) S = gfanGroebnerCone(J, L) S = gfanGroebnerCone(J, I) Inputs K:MarkedPolynomialList a marked reduced Groebner basis, or a minimal basis. M:MarkedPolynomialList a marked reduced Groebner basis. N:List a list of reduced Groebner basis, or a minimal basis. L:List a list of reduced Groebner basis. J:Ideal an ideal of reduced Groebner basis, or a minimal basis. I:Ideal an ideal of reduced Grobner basis. Outputs S:String a description of the Groebner cone of {\tt M} or {\tt I} or {\tt L} Description Text This method computes the Grobener cone of the input in the case where {\tt M}, {\tt L}, {\tt I} are reduced Groebner bases. If {\tt M}, {\tt L}, {\tt I} are only minimal bases, then a smaller cone is produced. Example QQ[x,y]; gfanGroebnerCone( markedPolynomialList {{x}, {x+y}} ) Text In the above example any weights {\em w = a(1,1) + p (1,-1)} for {\em a} a real number and {\em p >= 0} give {\em (x)} as the initial ideal of {\em (x+y)} with respect to {\em w}. When both {\tt K} and {\tt M} are given as input and are compatible marked reduced Groebner bases in the sense that {\tt K} is an initial ideal of {\tt M} then {\tt gfanGroebnerCone(K,M)} computes the cone of {\tt K} in the fan of {\tt M}. For example, the cone on which {\em (x+y)} is its own initial ideal is simply the line {\em w = a(1,1)} for {\em a} a real number. Example QQ[x,y]; gfanGroebnerCone( markedPolynomialList {{x}, {x+y}}, markedPolynomialList {{x}, {x+y}} ) Text Note that the {\tt pair} option will automatically be specified when two marked Groebner bases are given. @STRONG "gfan Documentation"@ @gfanHelp "gfan _groebnercone"@ /// doc /// Key gfanHomogeneitySpace (gfanHomogeneitySpace, List) (gfanHomogeneitySpace, MarkedPolynomialList) (gfanHomogeneitySpace, Ideal) Headline homogeneity space of a list of polynomials Usage gfanHomogeneitySpace(L) gfanHomogeneitySpace(M) gfanHomogeneitySpace(I) Inputs L:List of polynomials M:MarkedPolynomialList I: Ideal Outputs S:String polymake data with a lineality space of all weight vectors for which {\tt L} is homogeneous. Description Text This method computes the homogeneity space of {\tt L} or {\tt M} or {\tt I}. If a {\tt MarkedPolynomialList} is used, then the marked terms are simply ignored. Example QQ[x,y,z]; gfanHomogeneitySpace {x+y^2, y+z^2} Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _homogeneityspace"@ /// doc /// Key gfanHomogenize (gfanHomogenize, List, Symbol) (gfanHomogenize, MarkedPolynomialList, Symbol) (gfanHomogenize, Ideal, Symbol) Headline homogenize a list of polynomials with respect to a weight vector Usage G = gfanHomogenize(L,X) H = gfanHomogenize(M,X) H = gfanHomogenize(I,X) Inputs L:List of polynomials M:MarkedPolynomialList I:Ideal X:Symbol the homogenizing variable Outputs G:List polynomials from {\tt L} homogenized with variable {\tt X} H:MarkedPolynomialList polynomials from {\tt M} homogenized with variable {\tt X} Description Text The method homogenizes the polynomials in {\tt L} or {\tt M} or {\tt I} with respect to a given weight vector provided by the optional argument {\tt w}. If the {\tt w} option is not specified, the polynomials are homogenized with respect to total degree. This functionality is also provided by the @TO homogenize@ method which does not use {\tt gfan}. Example QQ[x,y]; L = {x+y, x^2*y + x}; gfanHomogenize(L, symbol z, "w" => {2,3}) QQ[x,y,z]; L = {x+y, x^2*y + x}; homogenize(matrix{L}, z, {2,3,1}) Text Using the variant that accepts a {\tt MarkedPolynomialList} as input produces a {\tt MarkedPolynomialList} as output. Example QQ[x,y]; L = markedPolynomialList {{y}, {x+y}}; gfanHomogenize(L, symbol z, "w" => {2,3}) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _homogenize"@ /// doc /// Key gfanInitialForms (gfanInitialForms, List, List) (gfanInitialForms, MarkedPolynomialList, List) (gfanInitialForms, Ideal, List) Headline initial forms of polynomials with respect to a weight vector Usage G = gfanInitialForms(L,W) G = gfanInitialForms(I,W) H = gfanInitialForms(M,W) Inputs L:List of polynomials I:Ideal M:MarkedPolynomialList W:List a weight vector Outputs G:List initial forms of the polynomials in {\tt L} or {\tt I} with respect to weight {\tt W} H:MarkedPolynomialList marked initial forms of the polynomials in {\tt M} with respect to weight {\tt W} Description Text This method gives the initial forms of a list of polynomials. If the {\tt "ideals"} option is used, generators for the initial ideal are given. If the {\tt "pair"} option is used, then the output is a pair of MarkedPolynomialLists. Example QQ[x,y,z] L = {x + y, x + z} gfanInitialForms(L, {1,2,1}) gfanInitialForms(L, {1,2,1}, "ideal"=>true) gfanInitialForms(L, {1,2,1}, "ideal"=>true, "pair"=>true) gfanInitialForms({x*y+z, x*z + y}, {1,1,1}, "ideal"=>true) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _initialforms"@ /// doc /// Key gfanInteractive Headline not implemented Description Text This method is not implemented. @STRONG "gfan Documentation"@ @gfanHelp "gfan _interactive"@ /// doc /// Key gfanIsMarkedGroebnerBasis (gfanIsMarkedGroebnerBasis, MarkedPolynomialList) (gfanIsMarkedGroebnerBasis, List) (gfanIsMarkedGroebnerBasis, Ideal) Headline checks if a list of polynomials are a Groebner basis Usage B = gfanIsMarkedGroebnerBasis(M) B = gfanIsMarkedGroebnerBasis(L) B = gfanIsMarkedGroebnerBasis(I) Inputs M:MarkedPolynomialList L:List I:Ideal Outputs B:Boolean true if input forms a Groebner basis Description Text This method takes a list of polynomial and determines if it is a Groebner basis with respect to some weight vector. Example QQ[x,y,z]; gfanIsMarkedGroebnerBasis({x^2+y, y^3+z}) gfanIsMarkedGroebnerBasis markedPolynomialList {{y,y^3}, {x^2+y, y^3+z}} Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _ismarkedgroebnerbasis"@ /// doc /// Key gfanKrullDimension (gfanKrullDimension, MarkedPolynomialList) (gfanKrullDimension, List) (gfanKrullDimension, Ideal) Headline krull dimension Usage D = gfanKrullDimension(M) D = gfanKrullDimension(L) D = gfanKrullDimension(I) Inputs M:MarkedPolynomialList a @TO2 {"MarkedPolynomialList", "marked Groebner basis"}@ L:List I:Ideal Outputs D:ZZ the Krull dimension of the polynomial ring modulo the ideal generated by {\tt M} or {\tt L} or the ideal {\tt I}. Description Text This method returns the Krull dimension of the quotient of the polynomial ring by the ideal generated by {\tt M} or {\tt L} or the ideal {\tt I}. Note that Macaulay 2 already provides this functionality (see @TO dim@). Example QQ[x,y,z,u,v]; L = {x^3, y^2}; gfanKrullDimension(L) dim ideal L Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _krulldimension"@ /// doc /// Key gfanLatticeIdeal (gfanLatticeIdeal, List) Headline computes the lattice ideal of a lattice Usage I = gfanLatticeIdeal L Inputs L:List of generators of the lattice Outputs I:List a list of generators for the lattice ideal Description Text This method computes the generators for the lattice ideal. The input should be a list of points that generate the lattice. Example gfanLatticeIdeal {{2,-1,0},{3,0,-1}} Text The lattice ideal of a free abelian subgroup $L$ of $\mathbb Z^n$ is the ideal generated by $ \mathbf{x}^{\alpha^+} - \mathbf{x}^{\alpha^-}$ for $\alpha =\alpha^+ - \alpha^- \in L$. @STRONG "gfan Documentation"@ @gfanHelp "gfan _latticeideal"@ /// doc /// Key gfanLeadingTerms (gfanLeadingTerms, List) (gfanLeadingTerms, MarkedPolynomialList) Headline leading terms of a list (or list of lists) of marked polynomials Usage T = gfanLeadingTerms(L) T = gfanLeadingTerms(M) Inputs L:MarkedPolynomialList M:List of MarkedPolynomialLists Outputs T:List the leading terms of {\tt L} (or lists of the leading terms of each list in {\tt M}) Description Text This method produces a list of the marked terms in a marked polynomial list. If the {\tt m} option is used it produces a list of the leading terms for a list of marked polynomial lists. This functionality is already provided in Macaulay 2 by the {\tt first} function. Example QQ[x,y,z]; L = gfanMarkPolynomialSet({x*y^3+z^4, x^2*z^2 + y^3*z}, {-1,2,5}) gfanLeadingTerms L first L M = gfanMarkPolynomialSet({x^2*y+y*z^2, x*z^2 + x*y*z}, {-1,2,5}) gfanLeadingTerms({M,L}, "m" => true) {M,L} / first Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _leadingterms"@ /// doc /// Key gfanMarkPolynomialSet (gfanMarkPolynomialSet, List, List) Headline mark the initial terms of a list of polynomials with respect to a weight vector Usage M = gfanMarkPolynomialSet(L,W) Inputs L:List of polynomials W:List a weight vector Outputs M:MarkedPolynomialList the polynomials in {\tt L} @TO2 {"MarkedPolynomialList", "marked"}@ with respect to {\tt W} Description Text This method marks the leading terms a given polynomial list. The leading term of a polynomial is the term whose exponent vector has the largest dot product with {\tt W}. Example QQ[x,y,z]; gfanMarkPolynomialSet({x + y + z, x^10 + y^4 + z^2, x^2*z + y^2}, {1, 3, 5}) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _markpolynomialset"@ /// doc /// Key gfanMinkowskiSum (gfanMinkowskiSum, List) (gfanMinkowskiSum, Ideal) Headline the Minkowski sum of Newton polytopes Usage P = gfanMinkowskiSum L P = gfanMinkowskiSum I Inputs L:List of polynomials I:Ideal Outputs P:Fan the normal fan of the Minkowski sum of the newton polytopes of the polynomials in {\tt L} or generators of {\tt I}. Description Text The Newton polytope of a polynomial is the convex hull of the exponent vectors of the terms. This method produces the normal fan of the Minkowski sum of these polytopes, which is the same as the common refinement of the normal fans. Example QQ[x,y] gfanMinkowskiSum { x + y + x*y } gfanMinkowskiSum { x + y + x*y + 1} gfanMinkowskiSum { x + y + x*y, x + y + x*y + 1} Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _minkowskisum"@ /// doc /// Key gfanMinors (gfanMinors, ZZ, ZZ, ZZ) Headline minors of a matrix of indeterminates Usage L = gfanMinors(r,d,n) Inputs r:ZZ size of the minor d:ZZ number of rows n:ZZ number of columns Outputs L:List a list of the {\tt r}x{\tt r} minors of a {\tt d}x{\tt n} matrix of indeterminates Description Text The method produces the {\tt r}x{\tt r} minors of a {\tt d}x{\tt n} matrix of indeterminates. Note that the variables in the output are indexed by strings. Example gfanMinors(2,3,3) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _minors"@ /// doc /// Key gfanMixedVolume (gfanMixedVolume, List) Headline mixed volume of a list of polynomials Usage n = gfanMixedVolume(L) Inputs L:List of polynomials Outputs n:ZZ the mixed volume for the Newton polytopes associated to the polynomials Description Text The method outputs mixed volume for the Newton polytopes associated to the input polynomials. The optional argument {\tt j} allows the user to set the number of threads to be used; by default, one thread is used. Example QQ[x1,x2,x3] gfanMixedVolume({x1+x2+x3,x1*x2+x2*x3+x3*x1,x1*x2*x3-1}) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _mixedvolume"@ /// doc /// Key gfanPolynomialSetUnion (gfanPolynomialSetUnion, MarkedPolynomialList, MarkedPolynomialList) (gfanPolynomialSetUnion, MarkedPolynomialList, List) (gfanPolynomialSetUnion, List, MarkedPolynomialList) (gfanPolynomialSetUnion, List, List) Headline union of two lists of polynomials Usage U = gfanPolynomialSetUnion(M,N) U = gfanPolynomialSetUnion(M,L) U = gfanPolynomialSetUnion(L,M) U = gfanPolynomialSetUnion(L,K) Inputs M:MarkedPolynomialList N:MarkedPolynomialList L:List K:List Outputs U:MarkedPolynomialList the union of lists the two inputs Description Text This method produces the union of two lists of polynomials. For this method when using MarkedpolynomialLists, the marked term of the polynomial is not considered. That is to say, the union is taken as if the polynomials were not marked. The resulting polynomials in the output are marked with preference given to the marked terms in the first argument. Example QQ[x,y,z]; f = x + y + z; g = x + y; h = y + z; L = markedPolynomialList {{z, y}, {f,g}} M = markedPolynomialList {{x, y} , {f,h}} gfanPolynomialSetUnion(L,M) gfanPolynomialSetUnion({f,g},{f,h}) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _polynomialsetunion"@ /// doc /// Key gfanRender (gfanRender, List) (gfanRender, String, List) Headline render an image of a Groebner fan Usage gfanRender(L) Inputs fileName:String the name of the file to be output, given without an extension L:List all @TO2 {"MarkedPolynomialList", "marked reduced Groebner bases"}@ of {\tt I} or an ideal Description Text This method renders the Groebner fan of an ideal and writes it to a {\tt .fig} file. If {\tt fig2dev} is installed then the {\tt .fig} file will be converted to {\tt .png} and displayed. The names of the {\tt .fig} and {\tt .png} files are printed on standard out. This method may support more options in the future to control rendering, conversion, and display. It may also eventually output file names in a list. @STRONG "gfan Documentation"@ @gfanHelp "gfan _render"@ /// doc /// Key gfanRenderStaircase (gfanRenderStaircase, List) (gfanRenderStaircase, String, List) Headline render the staircase of a monomial initial ideal Usage gfanRenderStaircase(L) gfanRenderStaircase(fileName, L) Inputs fileName:String the name of the file to be output, given without an extension L:List a @TO2 {"MarkedPolynomialList", "marked Groebner basis"}@ or lists of @TO2 {"MarkedPolynomialList", "marked Groebner bases"}@ (for use with the {\tt m} option) Description Text This method renders the staircase of the monomial initial ideal of the given Groebner basis (or bases in the case of the {\tt m} option). The rendered image is written to a {\tt .fig} file. If {\tt fig2dev} is installed then the {\tt .fig} file will be converted to {\tt .png} and displayed. The names of the {\tt .fig} and {\tt .png} files are printed on standard out. This method may support more options in the future to control rendering, conversion, and display. It may also eventually output file names in a list. @STRONG "gfan Documentation"@ @gfanHelp "gfan _renderstaircase"@ /// doc /// Key gfanResultantFan (gfanResultantFan, List) Headline Tropical variety of the sparse (toric) resultant variety. Usage gfanRenderStaircase(L) Inputs L:List Description Text This method computes the tropical variety of a sparse (toric) resultant variety. @STRONG "gfan Documentation"@ @gfanHelp "gfan _resultantfan"@ /// doc /// Key gfanSaturation (gfanSaturation, Ideal) Headline saturation of an ideal Usage gfanSaturation(I) Inputs I:Ideal Outputs L:List polynomials generating the saturation of {\tt I} with the product of the variables of the ring of {\tt I} Description Text This method computes the saturation of an ideal with respect to the product of the generators of the ideal's ring. Example QQ[x,y,z]; I = ideal(y*z*(x-1), x*(z^2 - y)); gfanSaturation I Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _saturation"@ /// doc /// Key gfanSecondaryFan (gfanSecondaryFan, List) Headline computes the secondary fan of a vector configuration Usage F = gfanSecondaryFan L Inputs L:List of integer vectors Outputs F:Fan the secondary fan of {\tt L} Description Text This method computes the secondary fan of a list of vectors. Example gfanSecondaryFan {{1,0},{1,1}, {1,2}, {1,2}} Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _secondaryfan"@ /// doc /// Key gfanStats (gfanStats, List) Headline display certain properties of a list of polynomials Usage gfanStats(L) Inputs L:List containing lists of @TO2 {"MarkedPolynomialList", "marked Groebner bases"}@ Outputs S:String describing the bases in {\tt L} Description Text This method outputs various information on a list of Groebner bases. The results are not parsed. Example QQ[x,y,z]; L = gfan {x*y + z} gfanStats L Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _stats"@ /// doc /// Key gfanSubstitute (gfanSubstitute, MarkedPolynomialList, PolynomialRing) (gfanSubstitute, List, PolynomialRing) (gfanSubstitute, Ideal, PolynomialRing) Headline rename the variables of a list of polynomials Usage gfanSubstitute(M,R) gfanSusbtitute(L,R) gfanSubstitute(I,R) Inputs M:MarkedPolynomialList of polynomials L:List of polynomials I:Ideal R:PolynomialRing with the same number of variables as the ring of the polynomials in {\tt M}, {\tt L} and {\tt I}. Outputs L:List of polynomials from {\tt L} with variables replaced by those in {\tt R} Description Text This method replaces each variable in a marked polynomial list with variables from a different ring. Example R = QQ[z,a,b]; S = QQ[x,y,z]; L = markedPolynomialList{{x*y, z^2} , {x*y+ z^2, x*y + z^2}} gfanSubstitute(L, R) Text Caution should be used as this method invokes {\tt use R} which changes the global symbol table. It would be preferable to use the map command which is built into Macaulay 2. A ring map can be applied directly to a marked polynomial list. Example f = map(R,S, {z,a,b}) f L Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _substitute"@ /// doc /// Key gfanToLatex (gfanToLatex, List) (gfanToLatex, MarkedPolynomialList) Headline convert a list of polynomials to LaTeX Usage gfanToLatex(L) gfanToLatex(M) Inputs L:List of marked polynomial lists or a marked polynomial list (for the {\tt polynomialset} option) M:MarkedPolynomialList Outputs S:String LaTeX markup for {\tt L} Description Text This method converts marked polynomial lists and lists of marked polynomial lists to latex. If the given input is a list, the option {\tt polynomialsetlist} is assumed. Similarly, if the input is a marked polynomial list then {\tt polynomialset} is assumed. Example QQ[x,y,z]; L = gfan{x^2 + y*z, z^2 + y*z} gfanToLatex L gfanToLatex first L gfanToLatex({{x,z}, {x+y, x+z}}, "polynomialset" => true) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tolatex"@ /// doc /// Key gfanToPolyhedralFan (gfanToPolyhedralFan, List) Headline polyhedral data about the fan of a list of Groebner bases Usage gfanToPolyhedralFan(L) Inputs L:List containing @TO2 {"MarkedPolynomialList", "marked reduced Groebner bases"}@ Outputs P:Fan the fan of the Groebner bases in {\tt L} Description Text This method takes a list of @TO2 {"MarkedPolynomialList", "marked reduced Groebner bases"}@ and outputs a polyhedral fan whose faces correspond to the marked Groebner bases. For example, @TEX "$x + y$"@ is a marked Groebner basis with initial term @TEX "$x$"@ for any weight vector @TEX "$(a,b)$"@ with @TEX "$a < b$"@. Example QQ[x,y] M = markedPolynomialList {{x},{x+y}} F = gfanToPolyhedralFan { M } Text The single facet above is @TEX "$\\mathbb R_{\\geq 0} (1,-1) + \\mathbb R (1,1)$"@ from reading off the ray and the lineality space. This corresponds to @TEX "$\\{(a,b) \\mid a < b\\}$"@. Adding in the Groebner basis with @TEX "$y$"@ as the initial term gives a second facet. Example L = markedPolynomialList {{y},{x+y}} F = gfanToPolyhedralFan { M, L } Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _topolyhedralfan"@ /// doc /// Key gfanTropicalBasis (gfanTropicalBasis, Ideal) Headline tropical basis of an ideal Usage gfanTropicalBasis(I) Inputs I:Ideal Outputs L:List of polynomials that give a tropical basis of {\tt I} Description Text This method produces a tropical basis of a given homogeneous ideal. If the ideal is not homogeneous, it must be homogenized using the {\tt h} option. Example QQ[x,y]; gfanTropicalBasis ideal {x^2+y^2, x^2-x*y} Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalbasis"@ /// doc /// Key gfanTropicalBruteForce (gfanTropicalBruteForce, List) Headline computes the tropical variety of an ideal Usage gfanTropicalBruteForce(L) Inputs L:MarkedPolynomialList a marked reduced Groebner basis for a homogeneous ideal Outputs F:Fan describing the tropical variety of the ideal of {\tt L} Description Text This method computes the tropical variety of a marked reduced Groebner basis (given in the form of a marked polynomial list). The following example is taken from the gfan documentation (v0.4 p.20). Example QQ[a,b,c,d,e,f,g,h,i,j] gfanTropicalBruteForce gfanBuchberger ideal "bf-ah-ce, bg-ai-de, cg-aj-df, ci-bj-dh, fi-ej-gh" Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalbruteforce"@ /// doc /// Key gfanTropicalEvaluation (gfanTropicalEvaluation, RingElement, List) Headline evaluates a tropical polynomial function Usage Y = gfanTropical(f, L) Inputs f:RingElement a polynomial L:List of points Outputs Y:List the values of the tropicalization of {\tt f} evaluated at each of the points in {\tt L} Description Text This method evaluates a tropical polynomial function at a list of points. Example QQ[x,y,z] gfanTropicalEvaluation(x*y+z^2, {{1,1,0}, {0,0,3}, {1,1,3} }) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalevaluation"@ SeeAlso gfanTropicalFunction /// doc /// Key gfanTropicalFunction (gfanTropicalFunction, RingElement) Headline tropicalizes a polynomial Usage F = gfanTropicalFunction(f) Inputs f:RingElement a polynomial Outputs F:Fan the tropicalization of {\tt f} Description Text This method tropicalizes a polynomial. The output is a piecewise linear function given in the form of a polyhedral fan. For example, the tropicalization of $x*y + z^2$ is max$(x+y, 2z)$. Example QQ[x,y,z] gfanTropicalFunction(x*y+z^2) Text To evaluate the tropical function at a point $p$, as given by the polyhedral data above, we write it a linear combination of the appropriate ray and lineality vectors. The coefficients used are then combined in a linear combination with the given ray values. For instance the point $p = (1, 7, 13)$ can be written as $3(-1,-1,2) + 2(2,0,1) + 5(0,2,1)$. The values on the these rays are $4, 2$ and $2$ respectively. Thus the tropical function evaluated at $p$ is $3*4 + 2*2 + 5*2 = 26$. @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalfunction"@ SeeAlso gfanTropicalEvaluation /// doc /// Key gfanTropicalHyperSurface (gfanTropicalHyperSurface, RingElement) Headline the tropical hypersurface of a principal ideal Usage F = gfanTropicalHyperSurface(f) Inputs f:RingElement a polynomial Outputs F:Fan the tropical hypersurface of the ideal generated by {\tt f} Description Text This method computes the tropical hypersurface of a principal ideal. Example QQ[x,y]; gfanTropicalHyperSurface(x^2 + x*y) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalhypersurface"@ SeeAlso gfanTropicalBruteForce /// doc /// Key gfanTropicalIntersection (gfanTropicalIntersection, List) Headline polyhedral data describing intersection of tropical hypersurfaces Usage gfanTropicalIntersection(L) Inputs L:List of polynomials Outputs F:Fan the intersection of the tropical hypersurfaces of polynomials in {\tt L} Description Text This method intersects a list of tropical hypersurfaces. The input is a list of polynomials whose tropicalizations give the hypersurfaces. Example QQ[x,y]; gfanTropicalHyperSurface(x+y) gfanTropicalHyperSurface(x+y+1) gfanTropicalIntersection {x+y, x+y+1} Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalintersection"@ SeeAlso gfanTropicalBruteForce gfanTropicalHyperSurface /// doc /// Key gfanTropicalLifting Headline not implemented Description Text This method is not implemented. @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicallifting"@ /// doc /// Key gfanTropicalLinearSpace (gfanTropicalLinearSpace, List, ZZ, ZZ) Headline equations of a tropical linear space from Plücker coordinates Usage (L, S) = gfanTropicalLinearSpace(P,N,D) Inputs P:List of Plücker coordinates N:ZZ ambient dimension D:ZZ subspace dimension Outputs L:List polynomials defining the linear space S:String a string describing which variable corresponds to which minor Description Text This method takes Plücker coordinates for a linear subspace and computes the polynomials which define the corresponding tropical linear space. The output is a pair which contains both the defining polynomials and a string which describes which coordinate corresponds to which minor. Example (L, S) = gfanTropicalLinearSpace({1,2,3}, 3, 1); L S Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicallinearspace"@ /// doc /// Key gfanTropicalMultiplicity (gfanTropicalMultiplicity, List) Headline multiplicity of a tropical cone Usage gfanTropicalMultiplicity(L) Inputs L:MarkedPolynomialList Outputs M:ZZ the multiplicity of the tropical cone of {\tt L} Description Text This method compute the multiplicity of a tropical cone. The tropical cone is described by a marked reduced Groebner basis for its initial ideal. @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalmultiplicity"@ /// doc /// Key gfanTropicalRank (gfanTropicalRank, Matrix) Headline the tropical rank of a matrix Usage (R, S) = gfanTropicalRank M Inputs M:Matrix Outputs R:ZZ the rank of {\tt M} S:String a description of how the rank was found Description Text This method computes the tropical rank of matrix. The output is a pair whose first coordinate is the rank and whose second coordinate is a string describing how the rank was computed. Example (R,S) = gfanTropicalRank matrix {{1,2},{1,2}}; R S Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalrank"@ /// doc /// Key gfanTropicalStartingCone (gfanTropicalStartingCone, List) (gfanTropicalStartingCone, Ideal) [gfanTropicalStartingCone, "stable", "g", "d"] Headline a pair of Groebner bases for use with gfanTropicalTraverse Usage gfanTropicalStartingCone(L) gfanTropicalStartingCone(I) Inputs L:List of polynomials, homogeneous with respect to a positive weight vector I:Ideal homogeneous with respect to a positive weight vector Outputs P:List a pair of @TO MarkedPolynomialList@s Description Text This method compute a pair of Groebner bases as needed for @TO gfanTropicalTraverse@. It heuristically finds a cone of the Tropical Variety. Its first output is the Groebner basis of the cone's monomial-free initial ideal. And the second output is the Groebner basis of the original ideal. Note that gfanTropicalStartingCone uses graded reverse lex order. Example QQ[x,y,z] gfanTropicalStartingCone{x+y+z} QQ[x,y] I=ideal(x+y) gfanTropicalStartingCone(I) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalstartingcone"@ SeeAlso gfanTropicalTraverse /// doc /// Key gfanTropicalTraverse (gfanTropicalTraverse, List) [gfanTropicalTraverse, "stable", "symmetry", "symsigns", "disableSymmetryTest", "nocones"] Headline polyhedral data describing a tropical variety Usage gfanTropicalTraverse(L) Inputs L:List a pair of @TO MarkedPolynomialList@s, homogeneous with respect to a positive weight vector Outputs F:Fan describing the tropical variety of the given ideal Description Text This method computes the tropical variety of a homogeneous ideal. Use @TO gfanTropicalStartingCone@ to produce the pair of Groebner bases that {\tt gfanTropicalTraverse} needs as input. It starts with the gfanTropicalStartingCone output which gives one of the Tropical Variety's cone, and traverses the rest of the Tropical Variety to find the remaining cones. It then outputs some key properties of the Tropical Variety. Cones gives the orbit of the cone if it exists. Multiplicities is the respective multiplicity of the maximal cones. And Maximal Cones refers to the cones of dimension DIM and DIM-1 and again gives the orbit of the cones. Changed in summer 2014: gfanTropicalTraverse now uses the min convention (so rays are -1 of the original gfan output). It currently returns a HashTable rather than a Fan. Example QQ[x,y,z] P = gfanTropicalStartingCone {x+y+z} gfanTropicalTraverse P Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicaltraverse"@ /// doc /// Key gfanTropicalWeilDivisor (gfanTropicalWeilDivisor, Fan, Fan) Headline the tropical Weil divisor of a piecewise linear function Usage W = gfanTropicalWeilDivisor(C,F) Inputs C:Fan a k-cycle F:Fan a piecewise linear function Outputs W:Fan the Weil divisor Description Text This method computes the tropical Weil divisor of a piecewise linear function. The following example is taken from the gfan manual. Example QQ[x_1..x_3]; C = gfanTropicalHyperSurface (x_1*x_2 + x_2*x_3 + x_1*x_3 + x_1*x_2*x_3) F = "..." Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _tropicalweildivisor"@ /// doc /// Key gfanOverIntegers (gfanOverIntegers,Ideal) (gfanOverIntegers,Ideal,List) Headline all reduced Groebner bases of a polynomial ideal with coefficients in ZZ Usage G = gfanOverIntegers(I) Inputs I:Ideal contained in a polynomial ring with coefficients in ZZ. The optional second list Outputs F:Fan G:List all @TO2 {"Marked Groebner Basis Example", "marked reduced Groebner bases"}@ of {\tt I}. L:List Description Text This method produces all reduced Groebner basis of a polynomial ideal with coefficients in ZZ. The input is given as an {\tt Ideal}. If just the ideal is given then the option "groebnerFan" => true" should also be added. For the second version, the list w is a weight vector for which the initial ideal or Groebner basis will be computed (depending on whether "initialIdeal=>true" or "groebnerBasis"=>true is set). Only one of these two can be set. Note that the Groebner fan over ZZ is more refined than the Groebner fan of the corresponding ideal with coefficients in QQ. Example R=ZZ[x,y] I=ideal(x^2-y^2,2*x) F=gfanOverIntegers(I,"groebnerFan"=>true) rays F linealitySpace F maxCones F G=gfanOverIntegers(I,{1,0},"groebnerBasis"=>true) H=gfanOverIntegers(I,{1,0},"initialIdeal"=>true) Text @STRONG "gfan Documentation"@ @gfanHelp "gfan _overintegers"@ /// doc/// Key gfanStableIntersection Headline computes the stable intersection of two balanced fans Usage gfanStableIntersection(Fan,List,Fan,List) Inputs F:Fan m1:List G:Fan m2:List Outputs H:Fan Description Text This function computes the stable intersection of two balanced fans. The input is two fans, and two lists of multiplicities that makes the fan balanced. The function does not check whether this fan is in fact balanced. /// --------------------------------------- -- Tests --------------------------------------- --status: need to fix comments in gfan, all of gfanFanProduct, in the --middle of gfanGroebnerCone -- TEST gfan TEST /// R = QQ[x,y,z]; L = gfan(ideal(x^2*y -y^2, y^2*x - x^2)); assert(#L == 4) assert(any(L, l -> set first l === set {y^5,x*y^2,x^2})) S = gfan({x^2*y -y^2, y^2*x - x^2}, "symmetry" => {{0,1,2}, {1,0,2}}) assert(#S == 2) -- G = gfan(markedPolynomialList {{y^5, x*y^2, x^2},{y^5-y^2,x*y^2 - y^4, x^2 -y^4}}, "g" => true) -- Gprime = { -- markedPolynomialList {{y^5,x*y^2,x^2},{y^5-y^2,-y^4+x*y^2,-y^4+x^2}}, -- markedPolynomialList {{y^4,x*y^2,x^2*y,x^3},{y^4-x^2,x*y^2-x^2,x^2*y-y^2,x^3-y^3}}, -- markedPolynomialList {{y^3,x*y^2,x^2*y,x^4},{-x^3+y^3,x*y^2-x^2,x^2*y-y^2,x^4-y^2}}, -- markedPolynomialList {{y^2,x^2*y,x^5},{-x^4+y^2,-x^4+x^2*y,x^5-x^2}} -- } -- assert(G == Gprime) -- may fail if the order of output changes /// -- TEST MPLConverter TEST /// equalMPL = (A,B) -> set transpose A === set transpose B QQ[x,y]; I = ideal(x^2 + y^2, x*y + y^2 + y^3); B = MPLConverter(I) Bprime = markedPolynomialList {{x^2, y^3},{x^2 + y^2, y^3 + x*y + y^2}} assert equalMPL(B,Bprime) /// -- TEST gfanConvertToNewRing x NCAlgebra (cf. #3600) TEST /// debug needsPackage "gfanInterface" R = QQ[a]; gfanConvertToNewRing(R); needsPackage "NCAlgebra"; gfanConvertToNewRing(R) /// -- TEST gfanBuchberger TEST /// equalMPL = (A,B) -> set transpose A === set transpose B QQ[x,y,z]; I = ideal(x*y + z, x*z + y); B = gfanBuchberger(I) Bprime = markedPolynomialList {{y^2,x*z,x*y},{y^2-z^2,x*z+y,x*y+z}} assert equalMPL(B,Bprime) A = gfanBuchberger(I, "w" => {1,2,3}) Aprime = markedPolynomialList {{z^2,x*z,x*y},{-y^2+z^2,x*z+y,x*y+z}} assert equalMPL(A,Aprime) assert not equalMPL(A, B) /// -- TEST gfanDoesIdealContain TEST /// QQ[x,y,z]; assert gfanDoesIdealContain(gfanBuchberger({x*y - y, x*z + z}), {y*z}) assert not gfanDoesIdealContain(gfanBuchberger({x*y - y, x*z + z}), {y*z+1}) /// -- TEST gfanCommonRefinement TEST /// QQ[x,y]; F = gfanToPolyhedralFan gfan {x+y}; G = gfanToPolyhedralFan gfan {x+y^2}; C = gfanFanCommonRefinement(F,G); assert(rank target rays(C) === 2) assert(dim(C) === 2) assert (isSimplicial(C)) assert(rank(linealitySpace(C)) === 0) assert(rank source rays(C) === 4) assert(rays(C) === transpose matrix {{-2, -1}, {-1, -1}, {1, 1}, {2, 1}}) assert(maxCones(C) === {{0, 1}, {0, 2}, {1, 3}, {2, 3}}) /// -- TEST gfanFanLink TEST /// QQ[x,y]; F = gfanToPolyhedralFan {markedPolynomialList{{x}, {x+y}}}; G = gfanToPolyhedralFan {markedPolynomialList{{y^2}, {x+y^2}}}; Q = gfanFanCommonRefinement(F,G); C = gfanFanLink(Q, {2,1}, "star" => true) assert(rank target rays(C) === 2) assert(dim(C) === 2) assert isSimplicial(C) assert(rank(linealitySpace(C)) === 0) assert(rank source rays(C) === 2) assert(rays(C) === transpose matrix {{1, 1}, {2, 1}}) assert(maxCones(C) === {{0,1}}) /// -- TEST gfanFanProduct -- TEST /// -- QQ[x,y]; -- F = gfanToPolyhedralFan {markedPolynomialList{{x}, {x+y}}}; -- G = gfanToPolyhedralFan {markedPolynomialList{{y^2}, {x+y^2}}}; -- C = gfanFanProduct(F,G); --Problem is that gfanFanProduct returns two lists. -- assert(rank(target(rays(C))) === 4) -- assert(dim(C) === 4) -- assert isSimplicial(C) -- assert(rank(linealitySpace(C)) === 2) -- assert(rank(source(rays(C)) === 2) -- assert(rays(C) === transpose matrix {{0, 0, -1, 2}, {1, -1, 0, 0}}) -- assert(maxCones(C) === {{0, 1}}) -- assert(linealitySpace(C) === {{1, 1, 0, 0}, {0, 0, 2, 1}}) -- /// -- TEST gfanGroebnerCone TEST /// QQ[x,y]; C = gfanGroebnerCone( markedPolynomialList {{x}, {x+y}} ) -- assert(set C#"IMPLIED_EQUATIONS" === set {}) assert(rank target rays C === 2) -- assert(C#"RELATIVE_INTERIOR_POINT" === {1, 0}) assert(linealitySpace(C) === transpose matrix {{1, 1}}) assert(rank(linealitySpace(C)) === 1) assert(dim(C) === 2) -- assert(set C#"FACETS" === set {{1,-1}}) -- C = gfanGroebnerCone( markedPolynomialList {{x}, {x+y}}, markedPolynomialList {{x}, {x+y}} ) -- assert(set C#"IMPLIED_EQUATIONS" === set {{1, -1}}) -- assert(C#"AMBIENT_DIM" === 2) -- assert(C#"RELATIVE_INTERIOR_POINT" === {0, 0}) -- assert(set C#"LINEALITY_SPACE" === set {{1, 1}}) -- assert(C#"LINEALITY_DIM" === 1) -- assert(C#"DIM" === 1) -- assert(set C#"FACETS" === set {}) /// -- -- TEST gfanHomogeneitySpace -- TEST /// -- QQ[x,y,z]; -- C = gfanHomogeneitySpace {x+y^2, y+z^2} -- assert(set C#"IMPLIED_EQUATIONS" === set {{1, 0, -4}, {0, 1, -2}}) -- assert(C#"AMBIENT_DIM" === 3) -- assert(C#"RELATIVE_INTERIOR_POINT" === {0, 0, 0}) -- assert(set C#"LINEALITY_SPACE" === set {{4, 2, 1}}) -- assert(C#"LINEALITY_DIM" === 1) -- assert(C#"DIM" === 1) -- assert(set C#"FACETS" === set {}) -- /// -- -- -- TEST gfanHomogenize -- TEST /// -- QQ[x,y]; -- L = {x+y, x^2*y + x}; -- H = gfanHomogenize(L, symbol z, "w" => {2,3}) -- assert(H == {x*z + y, x*z^5 + x^2*y}) -- QQ[x,y]; -- L = markedPolynomialList {{y}, {x+y}}; -- H = gfanHomogenize(L, symbol z, "w" => {2,3}) -- assert(H == markedPolynomialList {{y}, {y + x*z}}) -- /// -- -- -- TEST gfanInitialForms -- TEST /// -- QQ[x,y,z]; -- L = {x+y, x + z}; -- H = gfanInitialForms(L, {1,2,1}); -- assert(H == {y, x+z}); -- L = {x*y+z, x*z + y}; -- H = gfanInitialForms(L, {1,1,1}); -- assert(set H === set {x*y, x*z}); -- H = gfanInitialForms(L, {1,1,1}, "ideal" => true); -- assert(set H === set {y^2 - z^2, x*y, x*z}); -- /// -- -- -- TEST gfanInteractive (SKIPPED) -- -- -- TEST gfanIsMarkedGroebnerBasis -- TEST /// -- QQ[x,y,z]; -- assert gfanIsMarkedGroebnerBasis ({x^2+y, y^3+z}) -- assert not gfanIsMarkedGroebnerBasis markedPolynomialList {{y,y^3}, {x^2+y, y^3+z}} -- /// -- -- -- TEST gfanKrullDimension -- TEST /// -- QQ[x,y,z,u,v]; -- L = {x^3, y^2}; -- assert(gfanKrullDimension gfanBuchberger L === 3) -- /// -- -- -- TEST gfanLatticeIdeal -- TEST /// -- L = gfanLatticeIdeal {{2,-1,0},{3,0,-1}} -- assert(L === {-x_0 *x_1 + x_2, x_0^2 - x_1}) -- /// -- -- -- TEST gfanLeadingTerms -- TEST /// -- QQ[x,y,z]; -- L = gfanMarkPolynomialSet({x*y^3+z^4, x^2*z^2 + y^3*z}, {-1,2,5}) -- I = gfanLeadingTerms L -- assert( I == first L) -- /// -- -- -- TEST gfanMarkPolynomialSet -- TEST /// -- QQ[x,y,z]; -- equalMPL = (A,B) -> set transpose A === set transpose B -- M = gfanMarkPolynomialSet({x + y + z, x^10 + y^4 + z^2, x^2*z + y^2}, {1, 3, 5}) -- assert equalMPL(M, markedPolynomialList {{z,y^4,x^2*z},{x+y+z,x^10+y^4+z^2,x^2*z+y^2}}) -- /// -- -- -- TEST gfanMinkowskiSum -- TEST /// -- QQ[x,y]; -- M = gfanMinkowskiSum { x + y + x*y, x + y + x*y + 1} -- assert(M#"AMBIENT_DIM" === 2) -- assert(M#"MAXIMAL_CONES" == {{0, 1}, {0, 2}, {1, 3}, {2, 4}, {3, 4}}) -- assert(M#"DIM" === 2) -- assert(M#"RAYS" == {{-1, -1}, {-1, 0}, {0, -1}, {0, 1}, {1, 0}}) -- assert(M#"F_VECTOR" == {1, 5, 5}) -- /// -- -- -- TEST gfanMinors -- TEST /// -- M = gfanMinors(2,2,3) -- assert(M == {-m_"01"*m_"10"+m_"00"*m_"11",-m_"02"*m_"10"+m_"00"*m_"12",-m_"02"*m_"11"+m_"01"*m_"12"}) -- /// -- -- TEST gfanMixedVolume -- TEST /// -- QQ[x1,x2,x3,x4] -- mv = gfanMixedVolume({x1+x2+x3+x4,x1*x2+x2*x3+x3*x4+x4*x1,x1*x2*x3+x2*x3*x4+x3*x4*x1+x4*x1*x2,x1*x2*x3*x4-1}) -- assert (mv == 16) -- /// -- -- TEST gfanPolynomialSetUnion -- TEST /// -- QQ[x,y,z]; -- f = x + y + z; -- g = x + y; -- h = y + z; -- L = markedPolynomialList {{z, y}, {f,g}} -- M = markedPolynomialList {{x, y} , {f,h}} -- U = gfanPolynomialSetUnion(L,M) -- equalMPL = (A,B) -> set transpose A === set transpose B -- assert equalMPL(U, markedPolynomialList {{z,y,y},{x+y+z,x+y,y+z}}) -- /// -- -- -- TEST gfanRender SKIPPED -- -- TEST gfanRenderStaircase SKIPPED -- -- -- TEST gfanSaturation -- TEST /// -- QQ[x,y,z]; -- I = ideal(y*z*(x-1), x*(z^2 - y)); -- S = gfanSaturation I; -- assert(S == { z^2 -y, x-1}) -- /// -- -- -- TEST gfanSecondaryFan -- TEST /// -- F = gfanSecondaryFan {{1,0},{1,1}, {1,2}, {1,2}} -- assert(F#"AMBIENT_DIM" === 4) -- assert(F#"MAXIMAL_CONES" == {{0, 1}, {0, 2}, {1, 3}, {2, 3}}) -- assert(F#"SIMPLICIAL" === true) -- assert(F#"DIM" === 4) -- assert(F#"RAYS" == {{-2, 4, -1, -1}, {1, -2, -5, 6}, {1, -2, 6, -5}, {2, -4, 1, 1}}) -- assert(F#"ORTH_LINEALITY_SPACE" == {{1, -2, 0, 1}, {0, 0, 1, -1}}) -- assert(F#"CONES" == {{}, {0}, {1}, {2}, {3}, {0, 1}, {0, 2}, {1, 3}, {2, 3}}) -- assert(F#"LINEALITY_SPACE" == {{1, 0, -1, -1}, {0, 1, 2, 2}}) -- assert(F#"PURE" === true) -- assert(F#"LINEALITY_DIM" === 2) -- assert(F#"N_RAYS" === 4) -- assert(F#"F_VECTOR" == {1, 4, 4}) -- /// -- -- -- TEST gfanStats -- TEST /// -- QQ[x,y,z]; -- L = gfan {x*y + z}; -- S = gfanStats L -- assert(#S === 181) -- /// -- mytest -- TEST tropical min/max convention --this test is obsolete as minmax switch is now disabled --TEST /// -- by default the convention should be TROPICAL-MIN -- QQ[x,y,z]; -- loadPackage("gfanInterface", Reload=>true, Configuration=>{ "tropicalMax"=> false }); -- fan1 = gfanTropicalTraverse gfanTropicalStartingCone ideal(x+y+z); -- assert( member({2,-1,-1}, fan1#"Rays")); --/// --TEST /// -- alternatively TROPICAL-MAX can be specified on loading the package -- QQ[x,y,z]; -- loadPackage("gfanInterface", Reload=>true, Configuration=>{ "tropicalMax"=> true }); -- fan1 = gfanTropicalTraverse gfanTropicalStartingCone ideal(x+y+z); -- assert( member({-2,1,1}, fan1#"Rays")); --/// end-- restart --path = prepend(".",path) uninstallPackage "Polyhedra" uninstallPackage "gfanInterface" restart --path = prepend(".",path) installPackage "Polyhedra" installPackage "gfanInterface" restart loadPackage "gfanInterface" check gfanInterface ------------------------------------------------------------- ------------------------------------------------------------- ------------------------------------------------------------- -- Code for extracting options and methods loadPackage "gfanInterface" applyBinary = (L, f) -> ( S := null; scan(L, i -> if S === null then S = i else S = f(i,S)); S ) fns = select(gfanInterface#"exported symbols", k -> substring(0,4,toString k) == "gfan" and class value k === MethodFunctionWithOptions) apply(fns, f -> f => (value f, options value f)) opts = select(apply(fns, f -> options value f), o -> o =!= null) opts = applyBinary(opts, (x,y) -> x ++ y) sort keys opts ------------------------------------------------------------- ------------------------------------------------------------- ------------------------------------------------------------- restart installPackage("gfanInterface") uninstallPackage "gfanInterface" installPackage("gfanInterface", UserMode=>true, DebuggingMode=>true) installPackage("gfanInterface", DebuggingMode=>true, RemakeAllDocumentation => true, RerunExamples => true) restart loadPackage("gfanInterface", Configuration => { "path"=>"/usr/local/bin/", "keepfiles" => true, "verbose" => true, "cachePolyhedralOutput" => false }) debug gfanInterface F = gfanSecondaryFan {{1,0},{1,1}, {1,2}, {1,2}} G = gfanSecondaryFan {{1,1},{1,3}, {2,1}, {1,5}} H = gfanFanCommonRefinement(F,G) remove(F,"GfanFileName") gfanFanCommonRefinement(F,G) remove(F,"GfanFileRawString") gfanFanCommonRefinement(F,G) gfanFanProduct(F,G) oo#"FVector" gfanFanLink(H, {-45, -63, -81, 155}) peek oo R = QQ[a,b,c,d]; f = (1+a)*(1+b); g = (1+c)*(1+d); gfanMinkowskiSum{f,g} oo#"FVector" R = QQ[x,y,z]; I = ideal(x,y+z); L = transpose {{x,x},{z,y+z}}; L = gfan(I) gfan(ideal(x^2*y -z, y^2*z - x, z^2*x - y), "symmetry" => {{0,1,2}, {1,2,0}}) gfan(new MarkedPolynomialList from transpose{{x,x},{z,y+z}}) gfanBuchberger(I) gfanBuchberger(I, "w"=> {1,2,3}) gfanDoesIdealContain(L, {x}) gfanDoesIdealContain(L, {y}) gfanGroebnerCone(transpose{{x,x},{y,y+z}}) gfanGroebnerCone(transpose{{x,x},{y,y+z}}, "restrict"=>true) gfanGroebnerCone(transpose{{x,x},{y,y+z}}, "asfan"=>true) gfanGroebnerCone({transpose{{x,x},{y,y+z}},transpose{{y,y+z},{x,x}}}, "pair"=>true) gfanHomogeneitySpace(transpose{{x,x},{y,y+z}}) gfanHomogenize({z+1},a) gfanInitialForms({z+x+y},{2,1,2}) gfanInitialForms({z+x+y},{2,1,2}, "pair"=>true) gfanInitialForms({z+x+y},{2,1,2}, "ideal"=>true) gfanIsMarkedGroebnerBasis(transpose{{y,y+z},{x, x+1}}) gfanKrullDimension(transpose{{x,x+1}}) gfanLeadingTerms(transpose{{x,x+y},{z,z+x+y}}) gfanLeadingTerms({transpose{{x,x+y},{z,z+x+y}},transpose{{x*y,x*y + y^2}}}, "m"=>true) gfanMarkPolynomialSet({x+y+z}, {1,1,2}) gfanPolynomialSetUnion({x},{x+y}) gfanRender(gfan(ideal(x*y+z, y^3+x*z))) gfanRenderStaircase(transpose{{x,x},{y^3,y^3}, {z^2,z^2}}) gfanRenderStaircase({transpose{{x,x},{y^3,y^3}, {z^2,z^2}},transpose{{x,x},{y^3,y^3}, {z^2,z^2}}}, "m"=>true) gfanStats({transpose{{x,x+y},{z,z}},transpose{{y,y+x},{z,z}}}) gfanSubstitute(transpose{{y,y+x},{z,z}}, QQ[a,b,c]) gfanToLatex(transpose{{y,y+x},{z,z}}, "polynomialset"=>true) gfanToLatex({transpose{{y,y+x}},transpose{{z,z}}}, "polynomialsetlist"=>true) gfanToLatex({transpose{{y,y+x}},transpose{{z,z}}}, "polynomialsetlist"=>true, "h"=>true) gfanTropicalBasis(ideal{x^2+x*y, z^2}) gfanTropicalBasis(ideal{x^2+y, z^2}, "h"=>true) gfanTropicalIntersection({x^2+y, z^2}) gfanTropicalIntersection({x^2+y, z^2}, "t"=>true) gfanTropicalStartingCone({x^2+y*x, x*y+z^2}) gfanTropicalStartingCone({x^2+y*x, x*y+z^2}, "d"=>true) gfanTropicalTraverse(gfanTropicalStartingCone({x^2+y*x, x*y+z^2})) gfanTropicalMultiplicity(first gfanTropicalStartingCone({x^2+y*x, x*y+z^2})) gfanSaturation(ideal(z*y-z*x)) --gfanToPolyhedralFan({transpose{{x*y, x*y+ z}, {z,z}}, transpose{{x*y, x*y},{z,z}}}) --gfanToPolyhedralFan({transpose{{x*y, x*y+ z}, {z,z}}, transpose{{x*y, x*y},{z,z}}}, "restrict"=>true) --gfanToPolyhedralFan(gfan(ideal(x^2*y -z, y^2*z - x, z^2*x - y), {{0,1,2}, {1,2,0}}, "symmetry"=>true), {{0,1,2}, {1,2,0}}, "symmetry"=>true) gfanTropicalBruteForce(transpose{{x*y,x*y + z}, {z,z}}) -------- examples from the gfan manual ---------- R = QQ[a..j] I = ideal"bf-ah-ce, bg-ai-de, cg-aj-df, ci-bj-dh, fi-ej-gh" gfan I first oo last ooo o10/first/monomialIdeal -- Andrew, try this. You might need to update your M2, and rebuild, which gives you a bug-fixed gfan (0.4plus). -- I want to discuss with you at some point what the actual fields in the polymake object should be called, and what the types of their values should be. -- e.g. MULTIPLICITIES, and MULTIPLICITIES_COMPRESSED seem to have different types. **FIXED -- (other comments: -- MY_EULER is Anders' private info, so let's remove it **FIXED (errors are no longer produced on unrecognised blocks) -- _COMPRESSED should be called _ORBITS (Anders said so: he made a mistake) **NOT FIXED -- SIMPLICIAL: should be a boolean **FIXED (I updated the type and converted 1 into true) -- we should probably make the type: PolymakeFan **FIXED (now I'm parsing the type in the header) R = QQ[a..o] I = ideal"bg-aj-cf, bh-ak-df, bi-al-ef, ck-bm-dj, ch-am-dg, cl-ej-bn, ci-eg-an, dn-co-em, dl-bo-ek, di-ao-eh, gk-fm-jh, gl-fn-ij, hl-fo-ik, kn-jo-lm, hn-im-go" C = gfanTropicalStartingCone I_*; D = gfanTropicalTraverse(C, "symmetry" => {{0,8,7,6,5,4,3,2,1,14,13,11,12,10,9}, {5,6,7,8,0,9,10,11,1,12,13,2,14,3,4}}) --- examples of resultants and tropical hypersurface reconstruction (for gfan version 0.6) restart loadPackage("gfanInterface", FileName =>"/home/gtmath/Documents/math/M2codes/mine/gfanInterface.m2", Configuration => { -- "path" => "/usr/local/bin/", "path" => "/home/gtmath/Documents/math/software/gfan0.6beta/", "keepfiles" => true, "verbose" => true }) check "gfanInterface" A = {{{0,0},{1,0},{0,1}},{{0,0},{1,0},{2,1}},{{0,0},{0,1},{1,2}}} gfanResultantFan (A, "special" => {0,1,1,0,1,1,0,1,1}) QQ[x,y,z] A = {x+y+z,x+y+z,x+y+z} gfanResultantFan (A, "special" => {0,1,1,0,1,1,0,1,1})