<?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 : Table of Contents</title> <link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/> </head> <body><div><a href="index.html">top</a> | <a href="master.html">index</a> | <a href="http://www.math.uiuc.edu/Macaulay2/">Macaulay2 web site</a></div> <hr/> <h1>LexIdeals : Table of Contents</h1> <ul><li><span><span><a href="index.html" title="a package for working with lex ideals">LexIdeals</a> -- a package for working with lex ideals</span></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><span><a href="_generate__L__P__Ps_lp..._cm_sp__Print__Ideals_sp_eq_gt_sp..._rp.html" title="print LPP ideals nicely on the screen">generateLPPs(..., PrintIdeals => ...)</a> -- print LPP ideals nicely on the screen</span></span></li> <li><span><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></span></li> <li><span><span><a href="_hilbert__Funct_lp..._cm_sp__Max__Degree_sp_eq_gt_sp..._rp.html" title="bound degree through which Hilbert function is computed">hilbertFunct(..., MaxDegree => ...)</a> -- bound degree through which Hilbert function is computed</span></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><span><a href="_lex__Ideal.html" title="produce a lexicographic ideal">lexIdeal</a> -- produce a lexicographic ideal</span></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><span><a href="_macaulay__Rep.html" title="the Macaulay representation of an integer">macaulayRep</a> -- the Macaulay representation of an integer</span></span></li> <li><span><span><a href="___Max__Degree.html" title="optional argument for hilbertFunct">MaxDegree</a> -- optional argument for hilbertFunct</span></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><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></span></li> <li><span><span><a href="___Print__Ideals.html" title="optional argument for generateLPPs">PrintIdeals</a> -- optional argument for generateLPPs</span></span></li> </ul> </body> </html>
