Macaulay2 » Documentation
Packages » SlackIdeals :: graphicIdeal(...,Strategy=>...)
next | previous | forward | backward | up | index | toc

graphicIdeal(...,Strategy=>...) -- specifies saturation strategy to be used

See also

Functions with optional argument named Strategy:

  • addHook(...,Strategy=>...) -- see addHook -- add a hook function to an object for later processing
  • annihilator(...,Strategy=>...) (missing documentation)
  • basis(...,Strategy=>...) -- see basis -- basis or generating set of all or part of a ring, ideal or module
  • mingens(...,Strategy=>...) -- see Complement -- a Strategy option value
  • trim(...,Strategy=>...) -- see Complement -- a Strategy option value
  • compose(Module,Module,Module,Strategy=>...) -- see compose -- composition as a pairing on Hom-modules
  • cycleIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
  • decompose(Ideal,Strategy=>...) (missing documentation)
  • determinant(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
  • dual(MonomialIdeal,List,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
  • dual(MonomialIdeal,RingElement,Strategy=>...) -- see dual(MonomialIdeal,Strategy=>...)
  • dual(MonomialIdeal,Strategy=>...)
  • End(...,Strategy=>...) -- see End -- module of endomorphisms
  • epicResolutionMap(...,Strategy=>...) (missing documentation)
  • exteriorPower(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
  • gb(...,Strategy=>...) -- see gb -- compute a Gröbner basis
  • gcdLLL(...,Strategy=>...) (missing documentation)
  • GF(...,Strategy=>...) -- see GF -- make a finite field
  • graphicIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
  • grassmannSectionIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
  • greeneKleitmanPartition(...,Strategy=>...) -- see greeneKleitmanPartition -- computes the Greene-Kleitman partition of a poset
  • groebnerBasis(...,Strategy=>...) -- see groebnerBasis -- Gröbner basis, as a matrix
  • hasMinor(...,Strategy=>...) -- see hasMinor -- whether a matroid has a given minor
  • hermite(...,Strategy=>...) (missing documentation)
  • hibiRing(...,Strategy=>...) -- see hibiRing -- produces the Hibi ring of a poset
  • Hom(...,Strategy=>...) -- see Hom -- module of homomorphisms
  • homomorphism'(...,Strategy=>...) -- see homomorphism' -- get the element of Hom from a homomorphism
  • hooks(...,Strategy=>...) -- see hooks -- list hooks attached to a key
  • intersect(Ideal,Ideal,Strategy=>...) -- see intersect(Ideal,Ideal) -- compute an intersection of a sequence of ideals or modules
  • intersect(Module,Module,Strategy=>...) -- see intersect(Ideal,Ideal) -- compute an intersection of a sequence of ideals or modules
  • isIsomorphic(...,Strategy=>...) -- see isIsomorphic -- probabilistic test for isomorphism of modules
  • isomorphism(...,Strategy=>...) (missing documentation)
  • isPrime(Ideal,Strategy=>...) (missing documentation)
  • lcmLattice(...,Strategy=>...) -- see lcmLattice -- generates the lattice of lcms in an ideal
  • LLL(...,Strategy=>...) -- choose among different algorithms
  • match(...,Strategy=>...) -- see match -- regular expression matching
  • minors(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
  • parallelApply(...,Strategy=>...) -- see parallelApply -- apply a function to each element in parallel
  • pPartitionRing(...,Strategy=>...) -- see pPartitionRing -- produces the p-partition ring of a poset
  • pushForward(...,Strategy=>...) -- see pushForward(RingMap,Module) -- compute the pushforward of a module along a ring map
  • quotient'(...,Strategy=>...) (missing documentation)
  • quotient(...,Strategy=>...) (missing documentation)
  • rehomogenizeIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
  • resolutionMap(...,Strategy=>...) -- see resolutionMap -- map from a free resolution to the given complex
  • saturate(...,Strategy=>...) (missing documentation)
  • slackIdeal(...,Strategy=>...) -- specifies saturation strategy to be used
  • freeResolution(...,Strategy=>...) -- see Strategies for free resolutions -- overview of the different algorithms for computing free resolutions
  • syz(...,Strategy=>...) -- see syz(Matrix) -- compute the syzygy matrix
  • transitiveOrientation(...,Strategy=>...) -- see transitiveOrientation -- generates a poset whose comparability graph is the given graph

Further information

  • Default value: Eliminate
  • Function: graphicIdeal -- creates the toric ideal of the non-incidence graph of a polytope
  • Option key: Strategy -- an optional argument

The source of this document is in SlackIdeals.m2:2720:0.