Related papers: Computability Models: Algebraic, Topological and G…
Let $\Gamma$ be a subgroup of $PSL(2,R)$ generated by three parabolic transformations. The main goal of this paper is to present an algorithm to determine whether or not $\Gamma$ is discrete. Historically discreteness algorithms have been…
We give an arithmetic criterion which is sufficient to imply the discreteness of various two-generator subgroups of $PSL(2,{\bold C})$. We then examine certain two-generator groups which arise as extremals in various geometric problems in…
The discreteness problem, that is, the problem of determining whether or not a given finitely generated group G of orientation preserving isometries of hyperbolic three-space is discrete as a subgroup of the whole isometry group of…
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation questions, both unconditionally as well as relative to…
The higher-dimensional version of Kannan and Lipton's Orbit Problem asks whether it is decidable if a target subspace can be reached from a starting point under repeated application of a linear transformation. Similarly, the continuous…
We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing…
In this article, the decidability and computability issues of dynamic probability logic (DPL) are addressed. Firstly, a proof system $\mathcal{H}_{DPL}$ is introduced for DPL and shown that it is weakly complete. Furthermore, this logic has…
The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…
Let $K$ be a non-archimedean local field with residue field of characteristic $p$. We give necessary and sufficient conditions for a two-generator subgroup $G$ of ${\rm PSL_2}(K)$ to be discrete, where either $K=\mathbb{Q}_p$ or $G$…
We provide algorithms to decide whether a finitely generated subgroup of $\mathrm{SL}_2(\mathbb{R})$ is discrete, solve the constructive membership problem for finitely generated discrete subgroups of $\mathrm{SL}_2(\mathbb{R})$, and…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
We investigate the connections between the fields of distributed computing and measurable combinatorics by considering complexity classes of locally checkable labeling problems on regular forests. We show that the most important…
The problem of determining whether or not a non-elementary subgroup of $PSL(2,\CC)$ is discrete is a long standing one. The importance of two generator subgroups comes from J{\o}rgensen's inequality which has as a corollary the fact that a…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…
We deal with two-generator subgroups of PSL(2,C) with real traces of both generators and their commutator. We give discreteness criteria for these groups when at least one of the generators is parabolic. We also present a list of the…
The set of finitely generated subgroups of the group $PL_+(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…