The residual finiteness of HNN-extensions and generalized free products of nilpotent groups: a characterization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Residual P-Finiteness of Certain Generalized Free Products of Nilpotent Groups

We show that free products of finitely generated and residually p-finite nilpotent groups, amalgamating p-closed central subgroups are residually p-finite. As a consequence, we are able to show that generalized free products of residually p-finite abelian groups are residually p-finite if the amalgamated subgroup is closed in the pro-p topology on each of the factors.

متن کامل

On the Residual Solvability of Generalized Free Products of Finitely Generated Nilpotent Groups

In this paper we study the residual solvability of the generalized free product of finitely generated nilpotent groups. We show that these kinds of structures are often residually solvable.

متن کامل

Bounding the Residual Finiteness of Free Groups

We find a lower bound to the size of finite groups detecting a given word in the free group. More precisely we construct a word wn of length n in non-abelian free groups with the property that wn is the identity on all finite quotients of size ∼ n2/3 or less. This improves on a previous result of BouRabee and McReynolds quantifying the lower bound of the residual finiteness of free groups. A gr...

متن کامل

Positive theories of HNN-extensions and amalgamated free products

It is shown that the positive first-order theory of an HNN-extension G = 〈H, t; tat = φ(a)(a ∈ A)〉 can be reduced to the existential firstorder theory of G provided that A and B are proper subgroups of the base group H with A∩B finite. For an amalgamated free product G = H ∗A J , we show that the positive first-order theory of G can be reduced to the existential first-order theory of G in case ...

متن کامل

Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products

It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form by SLPs, which generalizes the classical NP-completeness result of the integer knapsack problem. We also prove general transfer results: NP-membership of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1992

ISSN: 0263-6115

DOI: 10.1017/s1446788700036570