Macaulay2 » Documentation
Packages » Macaulay2Doc :: rsort(...,MonomialOrder=>...)

Description

The meaning is the same as from sort(...,MonomialOrder=>...).

Further information

• Default value: Ascending
• Function: rsort -- sort a list or matrix in reverse order
• Option key: MonomialOrder -- monomial ordering

Functions with optional argument named MonomialOrder :

• graphIdeal(...,MonomialOrder=>...) -- see graphIdeal(RingMap) -- the ideal of the graph of the regular map corresponding to a ring map
• graphRing(...,MonomialOrder=>...) -- see graphRing(RingMap) -- the coordinate ring of the graph of the regular map corresponding to a ring map
• monoid(...,MonomialOrder=>...) -- specify the monomial ordering
• newRing(...,MonomialOrder=>...) -- see newRing -- make a copy of a ring, with some features changed
• pushForward(...,MonomialOrder=>...) -- see pushForward(RingMap,Module)
• rsort(...,MonomialOrder=>...) -- specify Ascending or Descending monomial order
• sort(...,MonomialOrder=>...) -- specify Ascending or Descending monomial order
• sortColumns(...,MonomialOrder=>...) -- specify Ascending or Descending monomial order
• symmetricAlgebra(...,MonomialOrder=>...) -- see symmetricAlgebra -- the symmetric algebra of a module
• tensor(Monoid,Monoid,MonomialOrder=>...) -- see tensor(Monoid,Monoid) -- tensor product of monoids
• tensor(Ring,Ring,MonomialOrder=>...) -- see tensor(Monoid,Monoid) -- tensor product of monoids