Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2008)
G
A. Myasnikov, A. Ushakov (2007)
Random subgroups and analysis of the length-based and quotient attacks, 2
L. Greenberg (1960)
Discrete Groups of MotionsCanadian Journal of Mathematics, 12
A. Myasnikov, V. Shpilrain, A. Ushakov (2008)
Group-based Cryptography
(2009)
Generic subgroups of group amalgams , Groups Complex
V. Kaimanovich, Ilya Kapovich, P. Schupp (2005)
The Subadditive Ergodic Theorem and generic stretching factors for free group automorphismsIsrael Journal of Mathematics, 157
B. Fine, A. Myasnikov, G. Rosenberger (2002)
MALNORMAL SUBGROUPS OF FREE GROUPSCommunications in Algebra, 30
G. Baumslag, O. Bogopolski, B. Fine, A. Gaglione, G. Rosenberger, D. Spellman (2008)
On Some Finiteness Properties in Infinite GroupsAlgebra Colloquium, 15
A. Macbeath (1967)
The Classification of Non-Euclidean Plane Crystallographic GroupsCanadian Journal of Mathematics, 19
B. Fine, A. Myasnikov, G. Rosenberger (2009)
Generic Subgroups of Group Amalgams, 1
(2009)
Asymptotische Gruppeneigenschaften und generische Untergruppen von freien und amalgamierten Produkten und HNN-Erweiterungen
(1992)
Fuchsian groups
A. Borovik, A. Myasnikov, V. Shpilrain (2002)
Measuring sets in infinite groupsarXiv: Group Theory
T. Camps, Volkmar Robel, G. Rosenberger (2008)
Einführung in die kombinatorische und die geometrische Gruppentheorie
Abstract Recall that asymptotic density is a method to compute densities and/or probabilities within infinite finitely generated groups. If is a group property, the asymptotic density determines the measure of the set of elements which satisfy . Is this asymptotic density equal to 1, we say that the property is generic in G . is called an asymptotic visible property, if the corresponding asymptotic density is strictly between 0 and 1. If the asymptotic density is 0, then is called negligible . We call a group property suitable if it is preserved under isomorphisms and its asymptotic density exists and is independent of finite generating systems. In this paper we prove that there is an interesting connection between the strong generic free group property of a group G and its subgroups of finite index.
Groups - Complexity - Cryptology – de Gruyter
Published: Dec 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.