Cycle decomposition
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, the term cycle decomposition can mean: * Cycle decomposition (graph theory), a partitioning of the vertices of a graph into subsets, such that the vertices in each subset lie on a cycle * Cycle decomposition (group theory), a useful convention for expressing a permutation in terms of its constituent cycles In commutative algebra and linear algebra, cyclic decomposition refers to writing a finitely generated module over a principal ideal domain as the direct sum of cyclic modules and one free module.
In mathematics, the term cycle decomposition can mean: Cycle decomposition (graph theory), a partitioning of the vertices of a graph into subsets, such that the vertices in each subset lie on a cycle Cycle decomposition (group theory), a useful convention for expressing a permutation in terms of its constituent cycles In commutative algebra and linear algebra, cyclic decomposition refers to writing a finitely generated module over a principal ideal domain as the direct sum of cyclic modules and one free module.
Text derived from https://en.wikipedia.org/w/index.php?oldid=748679521 under CC BY-SA 4.0; modifications have been made.