Group-theoretic orbit decidability
نویسنده
چکیده
A recent collection of papers in the last years have given a renovated interest to the notion of orbit decidability. This is a new quite general algorithmic notion, connecting with several classical results, and closely related to the study of the conjugacy problem for extensions of groups. In the present survey we explain several of the classical results closely related to this concept, and we explain the main ideas behind the recent connection with the conjugacy problem made by Bogopolski–Martino–Ventura in [2]. All the consequences up to date, published in several other papers by other authors, are also commented and reviewed.
منابع مشابه
The Polyhedron-Hitting Problem
We consider polyhedral versions of Kannan and Lipton's Orbit Problem [14, 13] determining whether a target polyhedron V may be reached from a starting point x under repeated applications of a linear transformation A in an ambient vector space Q. In the context of program veri cation, very similar reachability questions were also considered and left open by Lee and Yannakakis in [15], and by Bra...
متن کاملAlgebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics
We introduce a new method (derived from model theoretic general combination procedures in automated deduction) for proving fusion decidability in modal systems. We apply it to show fusion decidability in case not only the boolean connectives, but also a universal modality and nominals are shared symbols.
متن کاملGames with Second-order Quantiiers Which Decide Propositional Program Logics
The paper demonstrates how second-order quantiication and nite games can be exploited for deciding complicated propositional program logics like the propositional-Calculus with converse (C ?). This approach yields a new proof that C ? is in EXP T IME. Automata-theoretic technique is a very powerful and popular approach for deciding complicated propositional program logics 19, 20, 3]. The rst pa...
متن کاملDecidability Results for the Boundedness Problem
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula φ(X,x) that is positive in X, it is decidable whether the fixed-point recursion based on φ is spurious over the class of all trees in the sense that there is some uniform finite bound for the number of iterations φ takes ...
متن کاملA Survey of Measured Group Theory
Measured group theory is an area of research that studies infinite groups using measure-theoretic tools, and studies the restrictions that group structure imposes on ergodic-theoretic properties of their actions. This paper is a survey of recent developments focused on the notion of measure equivalence between groups, and orbit equivalence between group actions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Groups Complexity Cryptology
دوره 6 شماره
صفحات -
تاریخ انتشار 2014