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

randomMonomialSet(...,Strategy=>...) -- optional input to choose the strategy for generating the random monomial set

Description

Put Strategy => "ER" or Strategy => "Minimal" as an argument in the function randomMonomialSet, randomMonomialSets, or randomMonomialIdeals. "ER" draws random sets of monomials from the ER-type distribution $\mathcal B(n,D,p)$, while "Minimal" saves computation time by using quotient rings to exclude any non-minimal generators from the list. For randomMonomialSets with the number of generators of pre-specified degrees is the input, choosing Strategy => "Minimal" will result in larger minimal generating sets.

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
  • 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
  • exteriorPower(...,Strategy=>...) -- choose between Bareiss, Cofactor and Dynamic algorithms
  • gb(...,Strategy=>...) -- see gb -- compute a Gröbner basis
  • GF(...,Strategy=>...) -- see GF -- make a finite field
  • groebnerBasis(...,Strategy=>...) -- see groebnerBasis -- Gröbner basis, as a matrix
  • 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
  • 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
  • pushForward(...,Strategy=>...) -- see pushForward(RingMap,Module) -- compute the pushforward of a module along a ring map
  • quotient'(...,Strategy=>...) (missing documentation)
  • quotient(...,Strategy=>...) (missing documentation)
  • randomMonomialIdeals(...,Strategy=>...)
  • randomMonomialSet(...,Strategy=>...) -- optional input to choose the strategy for generating the random monomial set
  • randomMonomialSets(...,Strategy=>...)
  • saturate(...,Strategy=>...) (missing documentation)
  • syz(...,Strategy=>...) -- see syz(Matrix) -- compute the syzygy matrix

Further information

  • Default value: ER
  • Function: randomMonomialSet -- randomly generates a list of monomials in fixed number of variables up to a given degree
  • Option key: Strategy -- an optional argument

The source of this document is in RandomMonomialIdeals.m2:1312:0.