Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > 7ebd25ac536d248d499a3ce2acda963a > files > 3731

Macaulay2-1.3.1-8.fc15.i686.rpm

<?xml version="1.0" encoding="utf-8" ?>  <!-- for emacs: -*- coding: utf-8 -*- -->
<!-- Apache may like this line in the file .htaccess: AddCharset utf-8 .html -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN"	 "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg-flat.dtd" >
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head><title>RevLex -- reverse lexicographic ordering</title>
<link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/>
</head>
<body>
<table class="buttons">
  <tr>
    <td><div><a href="___N__C__Lex.html">next</a> | <a href="_definition_spof_spproduct_sp_lpblock_rp_sporders.html">previous</a> | <a href="___N__C__Lex.html">forward</a> | <a href="_definition_spof_spproduct_sp_lpblock_rp_sporders.html">backward</a> | <a href="_monomial_sporderings.html">up</a> | <a href="index.html">top</a> | <a href="master.html">index</a> | <a href="toc.html">toc</a> | <a href="http://www.math.uiuc.edu/Macaulay2/">Macaulay2 web site</a></div>

    </td>
  </tr>
</table>
<div><a href="index.html" title="">Macaulay2Doc</a> > <a href="_rings.html" title="">rings</a> > <a href="_monomial_sporderings.html" title="">monomial orderings</a> > <a href="___Rev__Lex.html" title="reverse lexicographic ordering">RevLex</a></div>
<hr/>
<div><h1>RevLex -- reverse lexicographic ordering</h1>
<div class="single"><h2>Description</h2>
<div>The reverse lexicographic order is defined by:  x<sup>A</sup> > x<sup>B</sup>  if the FIRST non-zero entry of the vector of integers <tt>A-B</tt> is NEGATIVE.  This is a local order, not a global order.  Therefore Gröbner bases over this ring only give generators over the local ring whose fractions are all elements not in the ideal generated by the variables.<table class="examples"><tr><td><pre>i1 : R = QQ[a..d,MonomialOrder => RevLex, Global => false];</pre>
</td></tr>
<tr><td><pre>i2 : a^3 + b^2 + b*c + a*c^2 + b^2*c + a + b + c

                    2    2           2    3
o2 = c + b + b*c + b  + b c + a + a*c  + a

o2 : R</pre>
</td></tr>
</table>
Computations of Gröbner bases for local orders are done using Mora's algorithm.</div>
</div>
<div class="single"><h2>See also</h2>
<ul><li><span><a href="___G__Rev__Lex.html" title="graded reverse lexicographical monomial order.">GRevLex</a> -- graded reverse lexicographical monomial order.</span></li>
<li><span><a href="___Monomial__Order.html" title="monomial ordering">Global</a> -- monomial ordering</span></li>
</ul>
</div>
<div class="waystouse"><h2>For the programmer</h2>
<p>The object <a href="___Rev__Lex.html" title="reverse lexicographic ordering">RevLex</a> is <span>a <a href="___Symbol.html">symbol</a></span>.</p>
</div>
</div>
</body>
</html>