Quelle chap3_mj.html Sprache: HTML

products/Sources/formale Sprachen/GAP/pkg/normalizinterface/doc/chap3_mj.html

<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
 "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<script type="text/javascript"
 src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<title>GAP (NormalizInterface) - Chapter 3: Examples</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chap3" onload="jscontent()">

<div class="chlinktop">Goto Chapter: <a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>

<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap2_mj.html">[Previous Chapter]</a> <a href="chap4_mj.html">[Next Chapter]</a> </div>

<a href="chap3.html">[MathJax off]</a>
<a id="X7A489A5D79DA9E5C" name="X7A489A5D79DA9E5C"></a>
<div class="ChapSects"><a href="chap3_mj.html#X7A489A5D79DA9E5C">3 Examples</a>
<div class="ContSect"> <a href="chap3_mj.html#X7BD5B55C802805B4">3.1 Generators</a>

</div>
<div class="ContSect"> <a href="chap3_mj.html#X872A3FB37D6D7DFE">3.2 System of equations</a>

</div>
<div class="ContSect"> <a href="chap3_mj.html#X8570F3C87B5B7DD7">3.3 System of inhomogeneous equations</a>

</div>
<div class="ContSect"> <a href="chap3_mj.html#X7B191A1778012C1D">3.4 Combined input</a>

</div>
<div class="ContSect"> <a href="chap3_mj.html#X8406B01578B99D14">3.5 Using the dual mode</a>

</div>
</div>

<h3>3 Examples</h3>

<a id="X7BD5B55C802805B4" name="X7BD5B55C802805B4"></a>

<h4>3.1 Generators</h4>

<div class="example"><pre>
gap> C := NmzCone(["integral_closure",[[2,1],[1,3]]]);
<a Normaliz cone>
gap> NmzHasConeProperty(C,"HilbertBasis");
false
gap> NmzHasConeProperty(C,"SupportHyperplanes");
false
gap> NmzConeProperty(C,"HilbertBasis");
[ [ 1, 1 ], [ 1, 2 ], [ 1, 3 ], [ 2, 1 ] ]
gap> NmzHasConeProperty(C,"SupportHyperplanes");
true
gap> NmzConeProperty(C,"SupportHyperplanes");
[ [ -1, 2 ], [ 3, -1 ] ]
</pre></div>

<a id="X872A3FB37D6D7DFE" name="X872A3FB37D6D7DFE"></a>

<h4>3.2 System of equations</h4>

<div class="example"><pre>
gap> D := NmzCone(["equations",[[1,2,-3]], "grading",[[0,-1,3]]]);
<a Normaliz cone>
gap> NmzCompute(D,["DualMode","HilbertSeries"]);
true
gap> NmzHilbertBasis(D);
[ [ 1, 1, 1 ], [ 0, 3, 2 ], [ 3, 0, 1 ] ]
gap> NmzHilbertSeries(D);
[ t^2-t+1, [ [ 1, 1 ], [ 3, 1 ] ] ]
gap> NmzHasConeProperty(D,"SupportHyperplanes");
true
gap> NmzSupportHyperplanes(D);
[ [ 0, 1, 0 ], [ 1, 0, 0 ] ]
gap> NmzEquations(D);
[ [ 1, 2, -3 ] ]
</pre></div>

<a id="X8570F3C87B5B7DD7" name="X8570F3C87B5B7DD7"></a>

<h4>3.3 System of inhomogeneous equations</h4>

<div class="example"><pre>
gap> P := NmzCone(["inhom_equations",[[1,2,-3,1]], "grading", [[1,1,1]]]);
<a Normaliz cone>
gap> NmzIsInhomogeneous(C);
false
gap> NmzIsInhomogeneous(P);
true
gap> NmzHilbertBasis(P);
[ [ 1, 1, 1, 0 ], [ 3, 0, 1, 0 ], [ 0, 3, 2, 0 ] ]
gap> NmzModuleGenerators(P);
[ [ 0, 1, 1, 1 ], [ 2, 0, 1, 1 ] ]
</pre></div>

<a id="X7B191A1778012C1D" name="X7B191A1778012C1D"></a>

<h4>3.4 Combined input</h4>

Normaliz also allows the combination of different kinds of input, e.g. multiple constraint types, or additional data like a grading.

Suppose that you have a 3 by 3 <q>square</q> of nonnegative integers such that the 3 numbers in all rows, all columns, and both diagonals sum to the same constant \(M\). Sometimes such squares are called magic and \(M\) is the magic constant. This leads to a linear system of equations. The magic constant is a natural choice for the grading. Additionally we force here the 4 corner to have even value by adding congruences.

<div class="example"><pre>
gap> Magic3x3even := NmzCone(["equations",
> [ [1, 1, 1, -1, -1, -1, 0, 0, 0],
> [1, 1, 1, 0, 0, 0, -1, -1, -1],
> [0, 1, 1, -1, 0, 0, -1, 0, 0],
> [1, 0, 1, 0, -1, 0, 0, -1, 0],
> [1, 1, 0, 0, 0, -1, 0, 0, -1],
> [0, 1, 1, 0, -1, 0, 0, 0, -1],
> [1, 1, 0, 0, -1, 0, -1, 0, 0] ],
> "congruences",
> [ [1, 0, 0, 0, 0, 0, 0, 0, 0, 2],
> [0, 0, 1, 0, 0, 0, 0, 0, 0, 2],
> [0, 0, 0, 0, 0, 0, 1, 0, 0, 2],
> [0, 0, 0, 0, 0, 0, 0, 0, 1, 2] ],
> "grading",
> [ [1, 1, 1, 0, 0, 0, 0, 0, 0] ] ] );
<a Normaliz cone>
gap> NmzHilbertBasis(Magic3x3even);
[ [ 0, 4, 2, 4, 2, 0, 2, 0, 4 ], [ 2, 0, 4, 4, 2, 0, 0, 4, 2 ],
 [ 2, 2, 2, 2, 2, 2, 2, 2, 2 ], [ 2, 4, 0, 0, 2, 4, 4, 0, 2 ],
 [ 4, 0, 2, 0, 2, 4, 2, 4, 0 ], [ 2, 3, 4, 5, 3, 1, 2, 3, 4 ],
 [ 2, 5, 2, 3, 3, 3, 4, 1, 4 ], [ 4, 1, 4, 3, 3, 3, 2, 5, 2 ],
 [ 4, 3, 2, 1, 3, 5, 4, 3, 2 ] ]
gap> NmzHilbertSeries(Magic3x3even);
[ t^3+3*t^2-t+1, [ [ 1, 1 ], [ 2, 2 ] ] ]
gap> NmzHilbertQuasiPolynomial(Magic3x3even);
[ 1/2*t^2+t+1, 1/2*t^2-1/2 ]
</pre></div>

<a id="X8406B01578B99D14" name="X8406B01578B99D14"></a>

<h4>3.5 Using the dual mode</h4>

For solving systems of equations and inequalities it is often faster to use the dual Normaliz algorithm. We demonstrate how to use it with an inhomogeneous system of equations and inequalities.

The input consists of a system of 8 inhomogeneous equations in R^3. The first row of the matrix M encodes the inequality \(8x + 8y + 8z + 7 \geq 0\). Additionally we say that \(x, y, z\) should be non-negative by giving the sign vector and use the total degree.

<div class="example"><pre>
gap> M := [
> [ 8, 8, 8, 7 ],
> [ 0, 4, 0, 1 ],
> [ 0, 1, 0, 7 ],
> [ 0, -2, 0, 7 ],
> [ 0, -2, 0, 1 ],
> [ 8, 48, 8, 17 ],
> [ 1, 6, 1, 34 ],
> [ 2,-12, -2, 37 ],
> [ 4,-24, -4, 14 ]
> ];;
gap> D := NmzCone(["inhom_inequalities", M,
> "signs", [[1,1,1]],
> "grading", [[1,1,1]]]);
<a Normaliz cone>
gap> NmzCompute(D,["DualMode","HilbertBasis","ModuleGenerators"]);
true
gap> NmzHilbertBasis(D);
[ [ 1, 0, 0, 0 ], [ 1, 0, 1, 0 ] ]
gap> NmzModuleGenerators(D);
[ [ 0, 0, 0, 1 ], [ 0, 0, 1, 1 ], [ 0, 0, 2, 1 ], [ 0, 0, 3, 1 ] ]
</pre></div>

As result we get the Hilbert basis of the cone of the solutions to the homogeneous system and the module generators which are the base solutions to the inhomogeneous system.

<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a> <a href="chap0_mj.html#contents">[Contents]</a> <a href="chap2_mj.html">[Previous Chapter]</a> <a href="chap4_mj.html">[Next Chapter]</a> </div>

<div class="chlinkbot">Goto Chapter: <a href="chap0_mj.html">Top</a> <a href="chap1_mj.html">1</a> <a href="chap2_mj.html">2</a> <a href="chap3_mj.html">3</a> <a href="chap4_mj.html">4</a> <a href="chapBib_mj.html">Bib</a> <a href="chapInd_mj.html">Ind</a> </div>

<hr />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</body>
</html>

quality100%

¤ Dauer der Verarbeitung: 0.13 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.