Sophie

Sophie

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

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>isLPP -- determine whether an ideal is an LPP ideal</title>
<link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/>
</head>
<body>
<table class="buttons">
  <tr>
    <td><div><a href="_is__Pure__Power.html">next</a> | <a href="_is__Lex__Ideal.html">previous</a> | <a href="_is__Pure__Power.html">forward</a> | <a href="_is__Lex__Ideal.html">backward</a> | up | <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>
<hr/>
<div><h1>isLPP -- determine whether an ideal is an LPP ideal</h1>
<div class="single"><h2>Synopsis</h2>
<ul><li><div class="list"><dl class="element"><dt class="heading">Usage: </dt><dd class="value"><div><tt>B=isLPP I</tt></div>
</dd></dl>
</div>
</li>
<li><div class="single">Inputs:<ul><li><span><tt>I</tt>, <span>an <a href="../../Macaulay2Doc/html/___Ideal.html">ideal</a></span>, an ideal in a polynomial ring</span></li>
</ul>
</div>
</li>
<li><div class="single">Outputs:<ul><li><span><tt>B</tt>, <span>a <a href="../../Macaulay2Doc/html/___Boolean.html">Boolean value</a></span>, <tt>true</tt> if <tt>I</tt> is an LPP ideal in <tt>ring I</tt> and <tt>false</tt> otherwise</span></li>
</ul>
</div>
</li>
</ul>
</div>
<div class="single"><h2>Description</h2>
<div><div>Given an ideal <tt>I</tt> in a polynomial ring <tt>R</tt>, <tt>isLPP</tt> checks that <tt>I</tt> is Artinian and that the power sequence is weakly increasing. Then <tt>isLPP</tt> computes bases of <tt>R/I</tt> in each degree up through the maximum degree of a minimal generator of <tt>I</tt> to determine whether <tt>I</tt> is an LPP ideal in <tt>R</tt>.</div>
<table class="examples"><tr><td><pre>i1 : R=ZZ/32003[a..c];</pre>
</td></tr>
<tr><td><pre>i2 : isLPP LPP(R,{1,3,4,3,2},{2,2,4})

o2 = true</pre>
</td></tr>
<tr><td><pre>i3 : isLPP ideal(a^3,b^3,c^3,a^2*b,a^2*c,a*b^2*c^2)

o3 = true</pre>
</td></tr>
<tr><td><pre>i4 : isLPP ideal(a^3,b^4) --not Artinian since no power of c

o4 = false</pre>
</td></tr>
<tr><td><pre>i5 : isLPP ideal(a^3,b^4,c^3) --powers not weakly increasing

o5 = false</pre>
</td></tr>
<tr><td><pre>i6 : isLPP ideal(a^3,b^3,c^3,a^2*b,a*b^2)

o6 = false</pre>
</td></tr>
</table>
</div>
</div>
<div class="single"><h2>See also</h2>
<ul><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="___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="_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>
</ul>
</div>
<div class="waystouse"><h2>Ways to use <tt>isLPP</tt> :</h2>
<ul><li>isLPP(Ideal)</li>
</ul>
</div>
</div>
</body>
</html>