Mathematical theory of saturation: Difference between revisions

Cmloegcmluin (talk | contribs)
add links back to general audience page
Cmloegcmluin (talk | contribs)
remove the other stuff I had added, including stuff which is now covered on other more specific pages
Line 10: Line 10:


To test for saturation, we may take the wedge product of the generators. Wedging {{map|26 41 60 72}} with {{map|12 19 28 34}} gives us {{multimap|2 8 20 8 26 24}}; this is not zero, so the rank of the group these generate is two. However the coefficients have a gcd of two, and hence the group is not saturated; for saturation, the coefficients must be relatively prime, with a gcd of one.
To test for saturation, we may take the wedge product of the generators. Wedging {{map|26 41 60 72}} with {{map|12 19 28 34}} gives us {{multimap|2 8 20 8 26 24}}; this is not zero, so the rank of the group these generate is two. However the coefficients have a gcd of two, and hence the group is not saturated; for saturation, the coefficients must be relatively prime, with a gcd of one.
= Wolfram Language implementation =
<nowiki>rightReducingMatrix[m_] := Last[SmithDecomposition[m]]
smithDefactor[m_] := Take[Inverse[rightReducingMatrix[m]], MatrixRank[m]]</nowiki>
= See also =
* [[defactoring]]


[[Category:math]]
[[Category:math]]