> <\body> Monomials are essentially wrappers of vectors of integer types. The class M,V\>|mmx::monomial> is defined in |multimix/monomial.hpp>. The first template argument refers to the class of vectors and to a type of storage of the ordering on the monomials. The default value of is nat\>. The default value of corresponds to a global storage initialized with the lexicographic ordering. <\cpp-code> #include \multimix/monomial.hpp\ ... monomial\\ x (vec\nat\ (1, 2)); // defines the monomial x * y^2 In the special context of ``lacunary polynomials'', integer\> can be used for . Several monomial orderings are defined in |multimix/monomial_ordering.hpp>. They are of type M\>|mmx::monomial_ordering>. The function M\ ()>|monomial_ordering\< M \> mmx::lex_ordering()> returns the lexicographical ordering. Other classical orderings are obtained M\ ()>|monomial_ordering\< M \> mmx::reverse_lex_ordering()>, M\ ()>|monomial_ordering\< M \> mmx::graded_lex_ordering()>, and M\ ()>|monomial_ordering\< M \> mmx::graded_reverse_lex_ordering()>. The static member M\::get_ordering ()>|static monomial_ordering\ M \ mmx::monomial::get_ordering()> returns the current ordering, while M\::set_ordering (const monomial_ordering\M\&)>|static void mmx::monomial::set_ordering(const monomial_ordering\< M \> &o)> allows to change it. The function |bool mmx::leq(const monomial_ordering\ M \ &ord, const monomial\ M, V \ &m1, const monomial\ M, V \ &m2)>, meaning ``less or equal'', compares two monomials with respect to the order given in its first argument. Other standard operators >, >, =>, => refer to the current ordering. The |vector\ monomial\ M, V \ \ mmx::sort(const monomial_ordering\ M \ &ord, const vector\ monomial\ M, V \ \ &v)> function can sort a vector of monomials according to the order given in its first argument. . If you don't have this file, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.> <\initial> <\collection>