INDICABLE GROUPS AND ENDOMORPHIC PRESENTATIONS

نویسندگان

چکیده

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

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

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

منابع مشابه

Endomorphic Presentations of Branch Groups

We introduce “endomorphic presentations”, or L-presentations: group presentations whose relations are iterated under a set of substitutions on the generating set, and show that a broad class of groups acting on rooted trees admit explicitly constructible finite L-presentations, generalising results by Igor Lysionok and Said Sidki.

متن کامل

Infinite Coxeter Groups Are Virtually Indicable

An infinite group G is called indicable (resp. virtually indicable) if G (resp. a subgroup of finite index in G) admits a homomorphism onto Z. This is a powerful property for a group to have; for example in the context of infinite fundamental groups of aspherical 3-manifolds it remains one of the outstanding open questions to prove such groups are virtually indicable. To continue on the 3-manif...

متن کامل

Amenable Groups with a Locally Invariant Order Are Locally Indicable

We show that every amenable group with a locally invariant partial order has a left-invariant total order (and is therefore locally indicable). We also show that if a group G admits a left-invariant total order, and H is a locally nilpotent subgroup of G, then a left-invariant total order on G can be chosen so that its restriction to H is both left-invariant and right-invariant. Both results fo...

متن کامل

L-presentations and Branch Groups

We introduce L-presentations: group presentations endowed with a set of substitutions on the generating set, and show that a broad class of groups acting on rooted trees admit explicitly constructible finite L-presentations.

متن کامل

Lexical Presentations of Groups

Using elementary ideas from formal language theory we introduce a kind of group presentation which makes solution of the word problem easy in the case of a nite group, and which in that case also makes possible an eecient algorithm to compute a traversal, i.e., a list of strings in generators in which each group element occurs exactly once.

متن کامل

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


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

ژورنال

عنوان ژورنال: Glasgow Mathematical Journal

سال: 2011

ISSN: 0017-0895,1469-509X

DOI: 10.1017/s0017089511000632