Related papers: Groups with ET0L co-word problem

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

Lists of equivalence classes of words under rotation or rotation plus reversal (i.e., necklaces and bracelets) have many uses, and efficient algorithms for generating these lists exist. In combinatorial group theory elements of a group are…

Two conjectures about homology groups, K-groups and topological full groups of minimal etale groupoids on Cantor sets are formulated. We verify these conjectures for many examples of etale groupoids including products of etale groupoids…

Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established protocols based on numeric computation. Notably, the protocols…

We describe simply connected compact exceptional simple Lie groups in very elementary way. We first construct all simply connected compact exceptional Lie groups G concretely. Next, we find all involutive automorphisms of G, and determine…

Higher order cohomology of arithmetic groups is expressed in terms of (g,K)-cohomology. Generalizing results of Borel, it is shown that the latter can be computed using functions of (uniform) moderate growth. A higher order versions of…

Thurston has claimed (unpublished) that central extensions of word hyperbolic groups by finitely generated abelian groups are automatic. We show that they are in fact biautomatic. Further, we show that every 2-dimensional cohomology class…

For any positive integer $n$, $\mathcal{A}_n$ is the class of all groups $G$ such that, for $0\leq i\leq n$, $H^i(\hat{G},A)\cong H^i(G,A)$ for every finite discrete $\hat{G}$-module $A$. We describe certain types of free products with…

We prove that Whitehead's algorithm for solving the automorphism problem in a fixed free group $F_k$ has strongly linear time generic-case complexity. This is done by showing that the ``hard'' part of the algorithm terminates in linear time…

We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…

We construct the cohomology groups with compact support of stacks of shtukas with $\mathbb Z_{\ell}$-coefficients. We construct the cuspidal cohomology groups and prove that they are $\mathbb Z_{\ell}$-modules of finite type. We prove that…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We show that the class of groups with $k$-multiple context-free word problem is closed under graphs of groups with finite edge groups.

Denote by E(Y) the group of homotopy classes of self-homotopy equivalences of a finite-dimensional complex Y. We give a selection of results about certain subgroups of E(Y). We establish a connection between the Gottlieb groups of Y and the…