Let F n be a free group with rank n, and denote by Out F n its outer automorphism group. For arbitrary n, consider the orders of periodic elements in Out F n or, equivalently, the orders of finite cyclic subgroups of Out F n . By considering group actions on finite connected graphs, we obtained the
Periodic Ordered Permutation Groups and Cyclic Orderings
β Scribed by M. Droste; M. Giraudet; D. Macpherson
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 486 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We prove that there are only finitely many CM-fields N with cyclic ideal class groups of 2-power orders such that the complex conjugation is the square of some automorphism of N. Since their actual determination would be too difficult, we only content ourselves with the determination of the nonquadr
Quasi-periodic behaviour in meteorological or climatological series is a widespread phenomenon; various attempts have been made to explain such behaviour in physical terms, often invoking external influences in the explanations. While it is not disputed that external influences or feedback mechanism
An ordered tree with specified degree sequence and n internal nodes has a i Ε½ . nodes of degree i, where a s 1 q Γ i y 1 a and n s Γ a . This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for gener