Zobrazeno 1 - 10
of 178
pro vyhledávání: '"Gilbert Baumslag"'
Cryptography has become essential as bank transactions, credit card infor-mation, contracts, and sensitive medical information are sent through inse-cure channels. This book is concerned with the mathematical, especially algebraic, aspects of cryptog
Publikováno v:
Journal of Information Security. :154-167
Password security is a crucial component of modern internet security. In this paper, we present a provably secure method for password verification using combinatorial group theory. This method relies on the group randomizer system, a subset of the MA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::930f0fdba1668992f01177e7fa66f660
https://doi.org/10.4236/jis.2018.92011
https://doi.org/10.4236/jis.2018.92011
In 1985, at Groups St Andrews, Gilbert Baumslag gave a short course on one-relator groups which provided a look at the subject up to that point. In this paper we partially update the massive amount of work done over the past three decades. For the mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2339de2d4535b8fe155b10595f9aca55
https://doi.org/10.1017/9781108692397.006
https://doi.org/10.1017/9781108692397.006
Publikováno v:
International Journal of Algebra and Computation. 26:1529-1546
We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c22b18b22d8c1932b2576f0729c8f8c3
https://doi.org/10.1142/s0218196716500673
https://doi.org/10.1142/s0218196716500673
This book contains the proceedings of two workshops on computational aspects of geometric group theory. The workshops, held in the winter of 1994 at DIMACS and at the Geometry Center, covered practical group theoretic computation and theoretical prob
We give a criterion for fibre products to be finitely presented and use it as the basis of a construction that encodes the pathologies of finite group presentations into pairs of groups \( P \subset G \) where G is a product of hyperbolic groups and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18d22bf2c52d5a121a06fdba3b59883d
https://doi.org/10.1007/s000140050136
https://doi.org/10.1007/s000140050136
We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even asynchronously automa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1fab7a7918836eb20ba050d42eb1c19c
https://ora.ox.ac.uk/objects/uuid:1d1ec4e1-6559-4453-a96c-cc365944d103
https://ora.ox.ac.uk/objects/uuid:1d1ec4e1-6559-4453-a96c-cc365944d103
The wreath product W = A ≀ T, where A ≠ 1, is of type F P2 if and only if T is finite and A is of type F P2.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bc82f342efd2eaecaf7e933d8ece1fa
https://ora.ox.ac.uk/objects/uuid:4cfa766c-62f9-4cec-b973-3770188c957e
https://ora.ox.ac.uk/objects/uuid:4cfa766c-62f9-4cec-b973-3770188c957e
Publikováno v:
Groups, Geometry, and Dynamics. :657-679
In 1954 A. G. Howson proved that the intersection of two finitely generated sub- groups of a free group is again finitely generated. Now the free metabelian subgroups of a free metabelian group of finite rank n are quite restricted. Indeed they are a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::329f91887fb0a4eb3c52dd70df982031
https://doi.org/10.4171/ggd/99
https://doi.org/10.4171/ggd/99
Publikováno v:
International Journal of Algebra and Computation. 19:213-227
We prove that the amalgamated product of free groups with cyclic amalgamations satisfying certain conditions are virtually free-by-cyclic. In case the cyclic amalgamated subgroups lie outside the derived group such groups are free-by-cyclic. Similarl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::602b043325f97dd1d4660be1bbf69687
https://doi.org/10.1142/s0218196709005032
https://doi.org/10.1142/s0218196709005032