๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm to construct the basis of the intersection of finitely generated free groups

โœ Scribed by S. L. Krivoi

Publisher
Springer US
Year
1983
Tongue
English
Weight
779 KB
Volume
18
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Algorithm for the Construction of a N
An Algorithm for the Construction of a Normal Basis
โœ Kurt Girstmair ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB

We present an algorithm for the construction of a normal basis of a Galois extension of degree n in characteristic 0. The algorithm requires O(n 4 ) multiplications in the ground field. It is based on representation theory but does not require the knowledge of representation theoretical data (like c

On the Intersection of Double Cosets in
On the Intersection of Double Cosets in Free Groups, with an Application to Amalgamated Products
โœ R.G. Burns; S.-M. Kam ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 244 KB

It is shown that if H, K are any finitely generated subgroups of a free group F and U is any cyclic subgroup of F, then any intersection Hg U l Kg U of double 1 2 ลฝ . cosets contains only a finite number of double cosets H l K gU, and an explicit upper bound for this number is given in terms of the

On the Number of Generators of Finite Im
On the Number of Generators of Finite Images of Free Products of Finite Groups
โœ Andrea Lucchini ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 108 KB

We prove that the analog of the Grushko-Neumann theorem does not hold for profinite free products of profinite groups. To do that we bound the number of generators of a finite group generated by a family of subgroups of pairwise coprime orders.