Difference between revisions of "ApCoCoA-1:Latte.Count"
From ApCoCoAWiki
| Line 14: | Line 14: | ||
<itemize> | <itemize> | ||
| − | <item><em>Equations</em>: A list of linear polynomials, which are equivalent to the equality-part of the polyhedral constraints</item> | + | <item>@param <em>Equations</em>: A list of linear polynomials, which are equivalent to the equality-part of the polyhedral constraints</item> |
| − | <item><em>LesserEq</em>: A list of linear polynomials, which are equivalent to the lower or equal-part of the polyhedral constraints</item> | + | <item>@param <em>LesserEq</em>: A list of linear polynomials, which are equivalent to the lower or equal-part of the polyhedral constraints</item> |
| − | <item><em> | + | <item>@param <em>GreaterEq</em>: A list of linear polynomials, which are equivalent to the greater or equal-part of the polyhedral constraints</item> |
| − | <item><em>Dil</em>: Integer > 0, factor for dilation of the polyhedral P, to count the lattice points of the polyhedral n*P</item> | + | <item>@param <em>Dil</em>: Integer > 0, factor for dilation of the polyhedral P, to count the lattice points of the polyhedral n*P</item> |
| + | <item>@return The number of lattice points in the given polyhedral P | ||
</itemize> | </itemize> | ||
Revision as of 19:26, 20 April 2009
Latte.Count
Counts the lattice points of a polyhedral given by a number of linear constraints
Syntax
Latte.Count(Equations: LIST, LesserEq: LIST, GreaterEq: LIST):INT
Syntax
Latte.Count(Equations: LIST, LesserEq: LIST, GreaterEq: LIST, Dil: INT):INT
Description
Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use
it/them.
@param Equations: A list of linear polynomials, which are equivalent to the equality-part of the polyhedral constraints
@param LesserEq: A list of linear polynomials, which are equivalent to the lower or equal-part of the polyhedral constraints
@param GreaterEq: A list of linear polynomials, which are equivalent to the greater or equal-part of the polyhedral constraints
@param Dil: Integer > 0, factor for dilation of the polyhedral P, to count the lattice points of the polyhedral n*P
<item>@return The number of lattice points in the given polyhedral P
Example
To count the lattice points in the polyhedral P = {x >= 0, y >= 0, x <= 1, x + y <= 1}:
Use S ::= QQ[x,y];
Equations := [];
LesserEq := [x-1, x+y-1];
GreaterEq := [x,y];
Latte.Count(Equations, LesserEq, GreaterEq);
