{\subsection{gfan}\label{applist:}
This is a program for computing all reduced Gr\"obner bases of a polynomial ideal. It takes a generating set for the ideal as input. By default the enumeration is done by an almost memoryless reverse search. If the ideal is symmetric the symmetry option is useful and enumeration will be done up to symmetry using a breadth first search. The program needs a starting Gr\"obner basis to do its computations. If the -g option is not specified it will compute one using Buchberger's algorithm.
\newline
{\bf Options:}
\begin{description}
\item[-g]Tells the program that the input is already a Gr\"obner basis (with the initial term of each polynomial being the first ones listed). Use this option if it takes too much time to compute the starting (standard degree lexicographic) Gr\"obner basis and the input is already a Gr\"obner basis.
\item[-\hspace{0.013cm}-symmetry]Tells the program to read in generators for a group of symmetries (subgroup of $S\_n$) after having read in the ideal. The program checks that the ideal stays fixed when permuting the variables with respect to elements in the group. The program uses breadth first search to compute the set of reduced Gr\"obner bases up to symmetry with respect to the specified subgroup.
\item[-e]Echo. Output the generators for the symmetry group.
\item[-\hspace{0.013cm}-disableSymmetryTest]When using -\hspace{0.013cm}-symmetry this option will disable the check that the group read off from the input actually is a symmetry group with respect to the input ideal.
\end{description}
{\subsection{gfan\_buchberger}\label{applist:_buchberger}
This program computes a reduced lexicographic Gr\"obner basis of the polynomial ideal given as input. The default behavior is to use Buchberger's algorithm. The ordering of the variables is $a>b>c...$ (assuming that the ring is Q[a,b,c,...]).
\newline
{\bf Options:}
\begin{description}
\item[-w]Compute a Gr\"obner basis with respect to a degree lexicographic order with $a>b>c...$ instead. The degrees are given by a weight vector which is read from the input after the generating set has been read.
\item[-r]Use the reverse lexicographic order (or the reverse lexicographic order as a tie breaker if -w is used). The input must be homogeneous if the pure reverse lexicographic order is chosen. Ignored if -W is used.
\item[-W]Do a Gr\"obner walk. The input must be a minimal Gr\"obner basis. If -W is used -w is ignored.
\item[-g]Do a generic Gr\"obner walk. The input must be homogeneous and must be a minimal Gr\"obner basis with respect to the reverse lexicographic term order. The target term order is always lexicographic. The -W option must be used.
\end{description}
{\subsection{gfan\_doesidealcontain}\label{applist:_doesidealcontain}
This program takes a marked Gr\"obner basis of an ideal I and a set of polynomials on its input and tests if the polynomial set is contained in I by applying the division algorithm for each element. The output is 1 for true and 0 for false.
{\subsection{gfan\_fancommonrefinement}\label{applist:_fancommonrefinement}
This program takes two polyhedral fans and computes their common refinement.
\newline
{\bf Options:}
\begin{description}
\item[-i1 value]Specify the name of the first input file.\item[-i2 value]Specify the name of the second input file.\end{description}
{\subsection{gfan\_fanlink}\label{applist:_fanlink}
This program takes a polyhedral fan and a vector and computes the link of the polyhedral fan around that vertex. The link will have lineality space dimension equal to the dimension of the relative open polyhedral cone of the original fan containing the vector.
\newline
{\bf Options:}
\begin{description}
\item[-i value]Specify the name of the input file.\item[-\hspace{0.013cm}-symmetry]Reads in the cone stored with symmetry. The generators of the symmetry group are given on the standard input.
\item[-\hspace{0.013cm}-star]Compute star. Here the star is defined as the closure of the polyhedral complex consisting of all cones of the original complex containing the vector.\end{description}
{\subsection{gfan\_fanproduct}\label{applist:_fanproduct}
This program takes two polyhedral fans and computes their product.
\newline
{\bf Options:}
\begin{description}
\item[-i1 value]Specify the name of the first input file.\item[-i2 value]Specify the name of the second input file.\end{description}
{\subsection{gfan\_groebnercone}\label{applist:_groebnercone}
This program computes a Gr\"obner cone. Three different cases are handled. The input may be a marked reduced Gr\"obner basis in which case its Gr\"obner cone is computed. The input may be just a marked minimal basis in which case the cone computed is not a Gr\"obner cone in the usual sense but smaller. (These cones are described in [Fukuda, Jensen, Lauritzen, Thomas]). The third possible case is that the Gr\"obner cone is possibly lower dimensional and given by a pair of Gr\"obner bases as it is useful to do for tropical varieties, see option -\hspace{0.013cm}-pair. The facets of the cone can be read off in section FACETS and the equations in section IMPLIED\_EQUATIONS.
\newline
{\bf Options:}
\begin{description}
\item[-\hspace{0.013cm}-restrict]Add an inequality for each coordinate, so that the the cone is restricted to the non-negative orthant.\item[-\hspace{0.013cm}-pair]The Gr\"obner cone is given by a pair of compatible Gr\"obner bases. The first basis is for the initial ideal and the second for the ideal itself. See the tropical section of the manual.\item[-\hspace{0.013cm}-asfan]Writes the cone as a polyhedral fan with all its faces instead. In this way the extreme rays of the cone are also computed.\item[-\hspace{0.013cm}-xml]Produce a polymake file in XML format.
\item[-\hspace{0.013cm}-vectorinput]Compute a cone given list of inequalities rather than a Gr\"obner cone. The input is an integer which specifies the dimension of the ambient space, a list of inequalities given as vectors and a list of equations.\end{description}
{\subsection{gfan\_homogeneityspace}\label{applist:_homogeneityspace}
This program computes the homogeneity space of a list of polynomials - as a cone. Thus generators for the homogeneity space are found in the section LINEALITY\_SPACE. If you wish the homogeneity space of an ideal you should first compute a set of homogeneous generators and call the program on these. A reduced Gr\"obner basis will always suffice for this purpose.
{\subsection{gfan\_homogenize}\label{applist:_homogenize}
This program homogenises a list of polynomials by introducing an extra variable. The name of the variable to be introduced is read from the input after the list of polynomials. Without the -w option the homogenisation is done with respect to total degree.
Example:
Input:
Q[x,y]\{y-1\}
Output:
Q[x,y,z]\{y-z\}
\newline
{\bf Options:}
\begin{description}
\item[-i]Treat input as an ideal. This will make the program compute the homogenisation of the input ideal. This is done by computing a degree Gr\"obner basis and homogenising it.\item[-w]Specify a homogenisation vector. The length of the vector must be the same as the number of variables in the ring. The vector is read from the input after the list of polynomials.
\end{description}
{\subsection{gfan\_initialforms}\label{applist:_initialforms}
This program converts a list of polynomials to a list of their initial forms with respect to the vector given after the list.
\newline
{\bf Options:}
\begin{description}
\item[-\hspace{0.013cm}-ideal]Treat input as an ideal. This will make the program compute the initial ideal of the ideal generated by the input polynomials. The computation is done by computing a Gr\"obner basis with respect to the given vector. The vector must be positive or the input polynomials must be homogeneous in a positive grading. None of these conditions are checked by the program.
\item[-\hspace{0.013cm}-pair]Produce a pair of polynomial lists. Used together with -\hspace{0.013cm}-ideal this option will also write a compatible reduced Gr\"obner basis for the input ideal to the output. This is useful for finding the Gr\"obner cone of a non-monomial initial ideal.
\item[-\hspace{0.013cm}-mark]If the -\hspace{0.013cm}-pair option is and the -\hspace{0.013cm}-ideal option is not used this option will still make sure that the second output basis is marked consistently with the vector.\end{description}
{\subsection{gfan\_interactive}\label{applist:_interactive}
This is a program for doing interactive walks in the Gr\"obner fan of an ideal. The input is a Gr\"obner basis defining the starting Gr\"obner cone of the walk. The program will list all flippable facets of the Gr\"obner cone and ask the user to choose one. The user types in the index (number) of the facet in the list. The program will walk through the selected facet and display the new Gr\"obner basis and a list of new facet normals for the user to choose from. Since the program reads the user's choices through the the standard input it is recommended not to redirect the standard input for this program.
\newline
{\bf Options:}
\begin{description}
\item[-L]Latex mode. The program will try to show the current Gr\"obner basis in a readable form by invoking LaTeX and xdvi.
\item[-x]Exit immediately.
\item[-f]Tell the program to list the flipped reduced Gr\"obner basis of the initial ideal for each flippable wall in the current Gr\"obner cone.
\item[-w]Tell the program to list (a Gr\"obner basis with respect to the current term order for) the initial ideal for each flippable wall in the current Gr\"obner cone.
\item[-i]Tell the program to list the defining set of inequalities of the non-restricted Gr\"obner cone as a set of vectors after having listed the current Gr\"obner basis.
\item[-W]Print weight vector. This will make the program print an interior vector of the current Gr\"obner cone and a relative interior point for each flippable facet of the current Gr\"obner cone.
\end{description}
{\subsection{gfan\_ismarkedgroebnerbasis}\label{applist:_ismarkedgroebnerbasis}
This program checks if a set of marked polynomials is a Gr\"obner basis with respect to its marking. First it is checked if the markings are consistent with respect to a positive vector. Then Buchberger's S-criterion is checked. The output is boolean value.
{\subsection{gfan\_krulldimension}\label{applist:_krulldimension}
Takes a Gr\"obner basis of an ideal $I$ and computes the Krull dimension of R/I where R is the polynomial ring.
{\subsection{gfan\_latticeideal}\label{applist:_latticeideal}
This program computes the lattice ideal of a lattice. The input is a list of generators for the lattice.
\newline
{\bf Options:}
\begin{description}
\item[-t]Compute the toric ideal of the matrix whose rows are given on the input instead.\end{description}
{\subsection{gfan\_leadingterms}\label{applist:_leadingterms}
This program converts a list of polynomials to a list of their leading terms.
\newline
{\bf Options:}
\begin{description}
\item[-m]Do the same thing for a list of polynomial sets. That is, output the set of sets of leading terms.
\end{description}
{\subsection{gfan\_markpolynomialset}\label{applist:_markpolynomialset}
This program marks a set of polynomials with respect to the vector given at the end of the input, meaning that the largest terms are moved to the front. In case of a tie the lexicographic term order with $a>b>c...$ is used to break it.
{\subsection{gfan\_minkowskisum}\label{applist:_minkowskisum}
This is a program for computing the normal fan of the Minkowski sum of the Newton polytopes of a list of polynomials.
\newline
{\bf Options:}
\begin{description}
\item[-\hspace{0.013cm}-symmetry]Tells the program to read in generators for a group of symmetries (subgroup of $S\_n$) after having read in the ideal. The program checks that the ideal stays fixed when permuting the variables with respect to elements in the group. The program uses breadth first search to compute the set of reduced Gr\"obner bases up to symmetry with respect to the specified subgroup.
\item[-\hspace{0.013cm}-disableSymmetryTest]When using -\hspace{0.013cm}-symmetry this option will disable the check that the group read off from the input actually is a symmetry group with respect to the input ideal.
\item[-\hspace{0.013cm}-nocones]Tell the program to not list cones in the output.\end{description}
{\subsection{gfan\_minors}\label{applist:_minors}
This program will generate the r*r minors of a d*n matrix of indeterminates.
\newline
{\bf Options:}
\begin{description}
\item[-r value]Specify r.\item[-d value]Specify d.\item[-n value]Specify n.\item[-M2]Use Macaulay2 conventions for order of variables.\item[-\hspace{0.013cm}-names]Assign names to the minors.\item[-\hspace{0.013cm}-dressian]Produce tropical defining the Dressian(3,n) instead. (This signs may not be correct, that is the equations may not be Pluecker relations.)\item[-\hspace{0.013cm}-pluckersymmetries]Do nothing but produce symmetry generators for the Pluecker ideal.\end{description}
{\subsection{gfan\_polynomialsetunion}\label{applist:_polynomialsetunion}
This program computes the union of a list of polynomial sets given as input. The polynomials must all belong to the same ring. The ring is specified an the input. After this follows the list of polynomial sets.
\newline
{\bf Options:}
\begin{description}
\item[-s]Sort output by degree.
\end{description}
{\subsection{gfan\_render}\label{applist:_render}
This program renders a Gr\"obner fan as an xfig file. To be more precise, the input is the list of all reduced Gr\"obner bases of an ideal. The output is a drawing of the Gr\"obner fan intersected with a triangle. The corners of the triangle are (1,0,0) to the right, (0,1,0) to the left and (0,0,1) at the top. If there are more than three variables in the ring these coordinates are extended with zeros. It is possible to shift the 1 entry cyclic with the option -\hspace{0.013cm}-shiftVariables.
\newline
{\bf Options:}
\begin{description}
\item[-L]Make the triangle larger so that the shape of the Gr\"obner region appears.\item[-\hspace{0.013cm}-shiftVariables value]Shift the positions of the variables in the drawing. For example with the value equal to 1 the corners will be right: (0,1,0,0,...), left: (0,0,1,0,...) and top: (0,0,0,1,...). The shifting is done modulo the number of variables in the polynomial ring. The default value is 0.\end{description}
{\subsection{gfan\_renderstaircase}\label{applist:_renderstaircase}
This program renders a staircase diagram of a monomial initial ideal to an xfig file. The input is a Gr\"obner basis of a (not necessarily monomial) polynomial ideal. The initial ideal is given by the leading terms in the Gr\"obner basis. Using the -m option it is possible to render more than one staircase diagram. The program only works for ideals in a polynomial ring with three variables.
\newline
{\bf Options:}
\begin{description}
\item[-m]Read multiple ideals from the input. The ideals are given as a list of lists of polynomials. For each polynomial list in the list a staircase diagram is drawn.
\item[-d value]Specifies the number of boxes being shown along each axis. Be sure that this number is large enough to give a correct picture of the standard monomials. The default value is 8.
\item[-w value]Width. Specifies the number of staircase diagrams per row in the xfig file. The default value is 5.
\end{description}
{\subsection{gfan\_saturation}\label{applist:_saturation}
This program computes the saturation of the input ideal with the product of the variables x\_1,...,x\_n. The ideal does not have to be homogeneous.
\newline
{\bf Options:}
\begin{description}
\item[-h]Tell the program that the input is a homogeneous ideal (with homogeneous generators).
\end{description}
{\subsection{gfan\_secondaryfan}\label{applist:_secondaryfan}
This program computes the secondary fan of a vector configuration. The configuration is given as an ordered list of vectors. In order to compute the secondary fan of a point configuration an additional coordinate of ones must be added. For example \{(1,0),(1,1),(1,2),(1,3)\}.
\newline
{\bf Options:}
\begin{description}
\item[-\hspace{0.013cm}-unimodular]Use heuristics to search for unimodular triangulation rather than computing the complete secondary fan\item[-\hspace{0.013cm}-scale value]Assuming that the first coordinate of each vector is 1, this option will take the polytope in the 1 plane and scale it. The point configuration will be all lattice points in that scaled polytope. The polytope must have maximal dimension. When this option is used the vector configuration must have full rank. This option may be removed in the future.\item[-\hspace{0.013cm}-symmetry]Tells the program to read in generators for a group of symmetries (subgroup of $S\_n$) after having read in the vector configuration. The program checks that the configuration stays fixed when permuting the variables with respect to elements in the group. The output is grouped according to the symmetry.
\end{description}
{\subsection{gfan\_stats}\label{applist:_stats}
This program takes a list of reduced Gr\"obner bases for the same ideal and computes various statistics. The following information is listed: the number of bases in the input, the number of variables, the dimension of the homogeneity space, the maximal total degree of any polynomial in the input and the minimal total degree of any basis in the input.
{\subsection{gfan\_substitute}\label{applist:_substitute}
This program changes the variable names of a polynomial ring. The input is a polynomial ring, a polynomial set in the ring and a new polynomial ring with the same coefficient field but different variable names. The output is the polynomial set written with the variable names of the second polynomial ring.
Example:
Input:
Q[a,b,c,d]\{2a-3b,c+d\}Q[b,a,c,x]
Output:
Q[b,a,c,x]\{2*b-3*a,c+x\}
{\subsection{gfan\_tolatex}\label{applist:_tolatex}
This program converts ASCII math to TeX math. The data-type is specified by the options.
\newline
{\bf Options:}
\begin{description}
\item[-h]Add a header to the output. Using this option the output will be LaTeXable right away.\item[-\hspace{0.013cm}-polynomialset\_]The data to be converted is a list of polynomials.\item[-\hspace{0.013cm}-polynomialsetlist\_]The data to be converted is a list of lists of polynomials.\end{description}
{\subsection{gfan\_topolyhedralfan}\label{applist:_topolyhedralfan}
This program takes a list of reduced Gr\"obner bases and produces the fan of all faces of these. In this way by giving the complete list of reduced Gr\"obner bases, the Gr\"obner fan can be computed as a polyhedral complex. The option -\hspace{0.013cm}-restrict lets the user choose between computing the Gr\"obner fan or the restricted Gr\"obner fan.
\newline
{\bf Options:}
\begin{description}
\item[-\hspace{0.013cm}-restrict]Add an inequality for each coordinate, so that the the cones are restricted to the non-negative orthant.\item[-\hspace{0.013cm}-symmetry]Tell the program to read in generators for a group of symmetries (subgroup of $S\_n$) after having read in the ring. The output is grouped according to these symmetries. Only one representative for each orbit is needed on the input.
\end{description}
{\subsection{gfan\_tropicalbasis}\label{applist:_tropicalbasis}
This program computes a tropical basis for an ideal defining a tropical curve. Defining a tropical curve means that the Krull dimension of R/I is at most 1 + the dimension of the homogeneity space of I where R is the polynomial ring. The input is a generating set for the ideal. If the input is not homogeneous option -h must be used.
\newline
{\bf Options:}
\begin{description}
\item[-h]Homogenise the input before computing a tropical basis and dehomogenise the output. This is needed if the input generators are not already homogeneous.\end{description}
{\subsection{gfan\_tropicalbruteforce}\label{applist:_tropicalbruteforce}
This program takes a marked reduced Gr\"obner basis for a homogeneous ideal and computes the tropical variety of the ideal as a subfan of the Gr\"obner fan. The program is slow but works for any homogeneous ideal. If you know that your ideal is prime over the complex numbers or you simply know that its tropical variety is pure and connected in codimension one then use gfan\_tropicalstartingcone and gfan\_tropicaltraverse instead.
{\subsection{gfan\_tropicalevaluation}\label{applist:_tropicalevaluation}
This program evaluates a tropical polynomial function in a given set of points.
{\subsection{gfan\_tropicalfunction}\label{applist:_tropicalfunction}
This program takes a polynomial and tropicalizes it. The output is piecewise linear function represented by a fan whose cones are the linear regions. Each ray of the fan gets the value of the tropical function assigned to it. In other words this program computes the normal fan of the Newton polytope of the input polynomial with additional information.{\subsection{gfan\_tropicalhypersurface}\label{applist:_tropicalhypersurface}
This program computes the tropical hypersurface defined by a principal ideal. The input is the polynomial ring followed by a set containing just a generator of the ideal.{\subsection{gfan\_tropicalintersection}\label{applist:_tropicalintersection}
This program computes the set theoretical intersection of a set of tropical hypersurfaces (or to be precise, their common refinement as a fan). The input is a list of polynomials with each polynomial defining a hypersurface. Considering tropical hypersurfaces as fans, the intersection can be computed as the common refinement of these. Thus the output is a fan whose support is the intersection of the tropical hypersurfaces.
\newline
{\bf Options:}
\begin{description}
\item[-t]Note that the input polynomials generate an ideal. This option will make the program choose a relative interior point for each listed output cone and check if its initial ideal contains a monomial. The actual check is done on a homogenization of the input ideal, but this does not affect the result.
\item[-\hspace{0.013cm}-tplane]This option intersects the resulting fan with the plane x\_0=-1, where x\_0 is the first variable. To simplify the implementation the output is actually the common refinement with the non-negative half space. This means that "stuff at infinity" (where x\_0=0) is not removed.\item[-\hspace{0.013cm}-symmetryPrinting]Parse a group of symmetries after the input has been read. Used when printing with -\hspace{0.013cm}-incidence.\item[-\hspace{0.013cm}-symmetryExploit]Restrict computation to the closed lexicographic fundamental domain of the specified symmetry group. This overwrites -\hspace{0.013cm}-restrict.\item[-\hspace{0.013cm}-restrict]Restrict the computation to a full-dimensional cone given by a list of marked polynomials. The cone is the closure of all weight vectors choosing these marked terms.\end{description}
{\subsection{gfan\_tropicallifting}\label{applist:_tropicallifting}
This program is part of the Puiseux lifting algorithm implemented in Gfan and Singular. The Singular part of the implementation can be found in:

Anders Nedergaard Jensen, Hannah Markwig, Thomas Markwig:
 tropical.lib. A SINGULAR 3.0 library for computations in tropical geometry, 2007 

See also

http://www.mathematik.uni-kl.de/\~{}keilen/de/tropical.html

and the paper

 Jensen, Markwig, Markwig: "An algorithm for lifting points in a tropical variety".

Example:

Run Singular from the directory where tropical.lib is located.
Give the following sequence of commands to Singular:

LIB "tropical.lib";
ring R=0,(t,x,y,z),dp;
ideal i=-y2t4+x2,yt3+xz+y;
intvec w=1,-2,0,2;
list L=tropicallifting(i,w,3);
displaytropicallifting(L,"subst");
This produces a Puiseux series solution to i with valuation (2,0,-2)
\newline
{\bf Options:}
\begin{description}
\item[-\hspace{0.013cm}-noMult]Disable the multiplicity computation.\item[-n value]Number of variables that should have negative weight.\item[-c]Only output a list of vectors being the possible choices.\end{description}
{\subsection{gfan\_tropicallinearspace}\label{applist:_tropicallinearspace}
This program generates tropical equations for a tropical linear space in the Speyer sense given the tropical Pluecker coordinates as input.
\newline
{\bf Options:}
\begin{description}
\item[-d value]Specify d.\item[-n value]Specify n.\item[-\hspace{0.013cm}-trees]list the boundary trees (assumes d=3)\end{description}
{\subsection{gfan\_tropicalmultiplicity}\label{applist:_tropicalmultiplicity}
This program computes the multiplicity of a tropical cone given a marked reduced Gr\"obner basis for its initial ideal.
{\subsection{gfan\_tropicalrank}\label{applist:_tropicalrank}
This program will compute the tropical rank of matrix given as input. Tropical addition is MAXIMUM.
\newline
{\bf Options:}
\begin{description}
\item[-\hspace{0.013cm}-kapranov]Compute Kapranov rank instead of tropical rank.\end{description}
{\subsection{gfan\_tropicalstartingcone}\label{applist:_tropicalstartingcone}
This program attempts to compute a starting pair of marked reduced Gr\"obner bases to be used as input for gfan\_tropicaltraverse. If unsuccessful the program will say so. The input is a homogeneous ideal whose tropical variety is a pure d-dimensional polyhedral complex.
\newline
{\bf Options:}
\begin{description}
\item[-g]Tell the program that the input is already a reduced Gr\"obner basis.\item[-d]Output dimension information to standard error.\end{description}
{\subsection{gfan\_tropicaltraverse}\label{applist:_tropicaltraverse}
This program computes a polyhedral representation of the tropical variety of a homogeneous prime ideal $I$. Let $d$ be the Krull dimension of $I$ and let $\omega$ be a relative interior point of $d$-dimensional Gr\"obner cone contained in the tropical variety. The input for this program is a pair of marked reduced Gr\"obner bases with respect to the term order represented by $\omega$, tie-broken in some way. The first one is for the initial ideal $in\_\omega(I)$ the second one for $I$ itself. The pair is the starting point for a traversal of the $d$-dimensional Gr\"obner cones contained in the tropical variety. If the ideal is not prime but with the tropical variety still being pure $d$-dimensional the program will only compute a codimension $1$ connected component of the tropical variety. By default the output is a list of properties of the ideal together with a polyhedral representation of the variety including cone descriptions in terms of ray incidence lists. Note that there are other quicker representations if you are not interested in this detailed description, see -\hspace{0.013cm}-noincidence.
\newline
{\bf Options:}
\begin{description}
\item[-\hspace{0.013cm}-symmetry]Do computations up to symmetry and group the output accordingly. If this option is used the program will read in a list of generators for a symmetry group after the pair of Gr\"obner bases have been read. Two advantages of using this option is that the output is nicely grouped and that the computation can be done faster. For best performance you should also specify -\hspace{0.013cm}-noincidence.\item[-\hspace{0.013cm}-symsigns]Specify for each generator of the symmetry group an element of $\{-1,+1\}^n$ which by its multiplication on the variables together with the permutation will keep the ideal fixed. The vectors are given as the rows of a matrix.\item[-\hspace{0.013cm}-nocones]Tells the program not to output the CONES and MAXIMAL\_CONES sections, but still output CONES\_COMPRESSED and MAXIMAL\_CONES\_COMPRESSED if -\hspace{0.013cm}-symmetry is used.\end{description}
{\subsection{gfan\_tropicalweildivisor}\label{applist:_tropicalweildivisor}
This program computes the tropical Weil divisor of piecewise linear (or tropical rational) function on a tropical k-cycle. See the Gfan manual for more information.
\newline
{\bf Options:}
\begin{description}
\item[-i1 value]Specify the name of the Polymake input file containing the k-cycle.\item[-i2 value]Specify the name of the Polymake input file containing the piecewise linear function.\end{description}