[back] [prev] [next] [index] [root]

<p>&nbsp;<p>
<hr noshade size="5">
<h2><a name="AbelianGroupIntersect"></a>
AbelianGroupIntersect
</h2>

Returns the intersection of two groups.

<p><p>

<h3>
Syntax:
</h3>
<pre>g := AbelianGroupIntersect(g1, g2);</pre>

<p>

<table>
<tr>
<td>groups</td>
<td><pre>  g, g1, g2  </pre></td>
<td></td>
</tr>
</table>

<p>


See also:&nbsp;&nbsp;<a href="kashref.html#AbelianGroupUnite">AbelianGroupUnite</a>

<p>

<h3>
Description:
</h3>
Returns the intersection g of the groups g1, g2. g is a group.


<p><p>

<p>
<hr>
<p>
<h3>
Example:
</h3>

<pre>

kash> g0 := AbelianGroupCreate([[0,1,2],[5,6,0],[0,4,5]]);
Group with relations:
[0 1 2]
[5 6 0]
[0 4 5]
kash> g1 := AbelianSubGroup(g0, [1,0,0]);
Group with relations:
[5]
kash> g2 := AbelianSubGroup(g0, [[0,1,0], [0,0,5]]);
Group with relations:
[1 1]
[0 3]
kash> g := AbelianGroupIntersect(g1, g2);
> Group with relations:
[1]

</pre>

<p>


<hr>

<p>
<a href="../kashref.html"><- back</a>[back] [prev] [next] [index] [root]