The algorithmic theory of finitely generated metabelian groups
HTML articles powered by AMS MathViewer
- by Gilbert Baumslag, Frank B. Cannonito and Derek J. S. Robinson PDF
- Trans. Amer. Math. Soc. 344 (1994), 629-648 Request permission
Abstract:
Algorithms are constructed which, when an explicit presentation of a finitely generated metabelian group G in the variety ${\mathcal {A}^2}$ is given, produce finitary presentations for the derived subgroup $G\prime$, the centre $Z(G)$, the Fitting subgroup $\operatorname {Fit}(G)$, and the Frattini subgroup $\varphi (G)$. Additional algorithms of independent interest are developed for commutative algebra which construct the associated set of primes $\operatorname {Ass}(M)$ of a finitely generated module M over a finitely generated commutative ring R, and the intersection ${\varphi _R}(M)$ of the maximal submodules of M.References
- Gilbert Baumslag, Frank B. Cannonito, and Charles F. Miller III, Infinitely generated subgroups of finitely presented groups. II, Math. Z. 172 (1980), no. 2, 97–105. MR 580852, DOI 10.1007/BF01182395
- Gilbert Baumslag, Frank B. Cannonito, and Charles F. Miller III, Computable algebra and group embeddings, J. Algebra 69 (1981), no. 1, 186–212. MR 613868, DOI 10.1016/0021-8693(81)90138-1
- Gilbert Baumslag, Frank B. Cannonito, Derek J. Robinson, and Dan Segal, The algorithmic theory of polycyclic-by-finite groups, J. Algebra 142 (1991), no. 1, 118–149. MR 1125209, DOI 10.1016/0021-8693(91)90221-S
- Gilbert Baumslag, Dion Gildenhuys, and Ralph Strebel, Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I, J. Pure Appl. Algebra 39 (1986), no. 1-2, 53–94. MR 816890, DOI 10.1016/0022-4049(86)90136-2
- G. Baumslag, U. Stammbach, and R. Strebel, The free metabelian group of rank two contains continuously many nonisomorphic subgroups, Proc. Amer. Math. Soc. 104 (1988), no. 3, 702. MR 941322, DOI 10.1090/S0002-9939-1988-0941322-X N. Bourbaki, Commutative algebra, Springer, Berlin, 1989.
- Patrizia Gianni, Barry Trager, and Gail Zacharias, Gröbner bases and primary decomposition of polynomial ideals, J. Symbolic Comput. 6 (1988), no. 2-3, 149–167. Computational aspects of commutative algebra. MR 988410, DOI 10.1016/S0747-7171(88)80040-3
- P. Hall, Finiteness conditions for soluble groups, Proc. London Math. Soc. (3) 4 (1954), 419–436. MR 72873, DOI 10.1112/plms/s3-4.1.419
- O. G. Harlampovič, A finitely presented solvable group with unsolvable word problem, Izv. Akad. Nauk SSSR Ser. Mat. 45 (1981), no. 4, 852–873, 928 (Russian). MR 631441
- M. F. Newman, On a class of metabelian groups, Proc. London Math. Soc. (3) 10 (1960), 354–364. MR 117293, DOI 10.1112/plms/s3-10.1.354
- G. A. Noskov, On conjugacy in metabelian groups, Mat. Zametki 31 (1982), no. 4, 495–507, 653 (Russian). MR 657712
- Derek J. S. Robinson, Splitting theorems for infinite groups, Symposia Mathematica, Vol. XVII (Convegno sui Gruppi Infiniti, INDAM, Rome, 1973) Academic Press, London, 1976, pp. 441–470. MR 0407153
- Derek John Scott Robinson, A course in the theory of groups, Graduate Texts in Mathematics, vol. 80, Springer-Verlag, New York-Berlin, 1982. MR 648604 N. S. Romanovskiĭ, The occurrence problem for extensions of abelian groups by nilpoten groups, Sibirsk. Mat. Ž. 21 (1980), 170-174.
- Dan Segal, Decidable properties of polycyclic groups, Proc. London Math. Soc. (3) 61 (1990), no. 3, 497–528. MR 1069513, DOI 10.1112/plms/s3-61.3.497
- A. Seidenberg, Constructions in algebra, Trans. Amer. Math. Soc. 197 (1974), 273–313. MR 349648, DOI 10.1090/S0002-9947-1974-0349648-2
- A. Seidenberg, Constructions in a polynomial ring over the ring of integers, Amer. J. Math. 100 (1978), no. 4, 685–703. MR 509069, DOI 10.2307/2373905
Additional Information
- © Copyright 1994 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 344 (1994), 629-648
- MSC: Primary 20F10; Secondary 13L05
- DOI: https://doi.org/10.1090/S0002-9947-1994-1202419-X
- MathSciNet review: 1202419