An automaton group with undecidable order and Engel problems

نویسندگان

چکیده

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

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

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

منابع مشابه

Decidable and Undecidable Second-Order Unification Problems

There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-order unification. Word unification can be easily decided by transformation rules (similar to the ones applied in higher-order unification procedures) when variables are restricted to occur at most twice. Hence a well-kno...

متن کامل

An automaton group: a computational case study

We introduce a two generated weakly branch contracting automaton group $G$ which is generated by a two state automaton on a three letter alphabet. Using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. Furthermore some algebraic properties of $G$ are detected .

متن کامل

Some Undecidable Problems in Group Theory

In this paper we obtain general results for undecidable first order decision problems about groups (that is, problems about elements in a particular group, such as the word and conjugacy problems). We shall describe a class ii of such decision problems and a construction A such that if P is a problem in Q, then A(P) will be a finitely presented group in which P is recursively undecidable. This ...

متن کامل

an automaton group: a computational case study

we introduce a two generated weakly branch contracting automaton group $g$ which is generated by a two state automaton on a three letter alphabet. using its branch structure and the finiteness nature of a sequence of its factor groups we compute the order of some of these factors. furthermore some algebraic properties of $g$ are detected .

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2018

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2017.11.049