<?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>LexIdeals -- a package for working with lex ideals</title>
<link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/>
</head>
<body>
<table class="buttons">
<tr>
<td><div><a href="_cancel__All.html">next</a> | previous | <a href="_cancel__All.html">forward</a> | backward | up | top | <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>
<hr/>
<div><h1>LexIdeals -- a package for working with lex ideals</h1>
<div class="single"><h2>Description</h2>
<div><div><em>LexIdeals</em> is a package for creating lexicographic ideals and lex-plus-powers (LPP) ideals. There are also several functions for use with the multiplicity conjectures of Herzog, Huneke, and Srinivasan.</div>
</div>
</div>
<div class="single"><h2>Author</h2>
<ul><li><div class="single"><a href="http://www.math.okstate.edu/~chris">Chris Francisco</a><span> <<a href="mailto:chris@math.okstate.edu">chris@math.okstate.edu</a>></span></div>
</li>
</ul>
</div>
<div class="single"><h2>Version</h2>
This documentation describes version <b>1.2</b> of LexIdeals.</div>
<div class="single"><h2>Source code</h2>
The source code from which this documentation is derived is in the file <a href="../../../../Macaulay2/LexIdeals.m2">LexIdeals.m2</a>.</div>
<div class="single"><h2>Exports</h2>
<ul><li><div class="single">Functions<ul><li><span><a href="_cancel__All.html" title="make all potentially possible cancellations in the graded free resolution of an ideal">cancelAll</a> -- make all potentially possible cancellations in the graded free resolution of an ideal</span></li>
<li><span><a href="_generate__L__P__Ps.html" title="return all LPP ideals corresponding to a given Hilbert function">generateLPPs</a> -- return all LPP ideals corresponding to a given Hilbert function</span></li>
<li><span><a href="_hilbert__Funct.html" title="return the Hilbert function of a polynomial ring mod a homogeneous ideal as a list">hilbertFunct</a> -- return the Hilbert function of a polynomial ring mod a homogeneous ideal as a list</span></li>
<li><span><a href="_is__C__M.html" title="test whether a polynomial ring modulo a homogeneous ideal is Cohen-Macaulay">isCM</a> -- test whether a polynomial ring modulo a homogeneous ideal is Cohen-Macaulay</span></li>
<li><span><a href="_is__H__F.html" title="is a finite list a Hilbert function of a polynomial ring mod a homogeneous ideal">isHF</a> -- is a finite list a Hilbert function of a polynomial ring mod a homogeneous ideal</span></li>
<li><span><a href="_is__Lex__Ideal.html" title="determine whether an ideal is a lexicographic ideal">isLexIdeal</a> -- determine whether an ideal is a lexicographic ideal</span></li>
<li><span><a href="_is__L__P__P.html" title="determine whether an ideal is an LPP ideal">isLPP</a> -- determine whether an ideal is an LPP ideal</span></li>
<li><span><a href="_is__Pure__Power.html" title="determine whether a ring element is a pure power of a variable">isPurePower</a> -- determine whether a ring element is a pure power of a variable</span></li>
<li><span><a href="_lex__Ideal.html" title="produce a lexicographic ideal">lexIdeal</a> -- produce a lexicographic ideal</span></li>
<li><span><a href="___L__P__P.html" title="return the lex-plus-powers (LPP) ideal corresponding to a given Hilbert function and power sequence">LPP</a> -- return the lex-plus-powers (LPP) ideal corresponding to a given Hilbert function and power sequence</span></li>
<li><span><a href="_macaulay__Bound.html" title="the bound on the growth of a Hilbert function from Macaulay's Theorem">macaulayBound</a> -- the bound on the growth of a Hilbert function from Macaulay's Theorem</span></li>
<li><span><a href="_macaulay__Lower__Operator.html" title="the a_<d> operator used in Green's proof of Macaulay's Theorem">macaulayLowerOperator</a> -- the a_<d> operator used in Green's proof of Macaulay's Theorem</span></li>
<li><span><a href="_macaulay__Rep.html" title="the Macaulay representation of an integer">macaulayRep</a> -- the Macaulay representation of an integer</span></li>
<li><span><a href="_mult__Bounds.html" title="determine whether an ideal satisfies the upper and lower bounds of the multiplicity conjecture">multBounds</a> -- determine whether an ideal satisfies the upper and lower bounds of the multiplicity conjecture</span></li>
<li><span><a href="_mult__Lower__Bound.html" title="determine whether an ideal satisfies the lower bound of the multiplicity conjecture">multLowerBound</a> -- determine whether an ideal satisfies the lower bound of the multiplicity conjecture</span></li>
<li><span><a href="_mult__Upper__Bound.html" title="determine whether an ideal satisfies the upper bound of the multiplicity conjecture">multUpperBound</a> -- determine whether an ideal satisfies the upper bound of the multiplicity conjecture</span></li>
<li><span><a href="_mult__Upper__H__F.html" title="test a sufficient condition for the upper bound of the multiplicity conjecture">multUpperHF</a> -- test a sufficient condition for the upper bound of the multiplicity conjecture</span></li>
</ul>
</div>
</li>
<li><div class="single">Symbols<ul><li><span><a href="___Max__Degree.html" title="optional argument for hilbertFunct">MaxDegree</a> -- optional argument for hilbertFunct</span></li>
<li><span><a href="___Print__Ideals.html" title="optional argument for generateLPPs">PrintIdeals</a> -- optional argument for generateLPPs</span></li>
</ul>
</div>
</li>
</ul>
</div>
</div>
</body>
</html>
