Related papers: Group extensions over infinite words

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

Motivated by its applications to the word problem for one-relator inverse monoids, via results of Ivanov, Margolis, and Meakin (2001), we prove several decidability and undecidability results about the submonoid membership problem in…

In this paper we study non-abelian extensions of a Lie group $G$ modeled on a locally convex space by a Lie group $N$. The equivalence classes of such extension are grouped into those corresponding to a class of so-called smooth outer…

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…

We establish some general principles and find some counter-examples concerning the Pontryagin reflexivity of precompact groups and P-groups. We prove in particular that: (1) A precompact Abelian group G of bounded order is reflexive iff the…

Given a group G and a G-module A, we show how to determine up to isomorphism the extensions E of A by G so that A embeds as smallest non-trivial term of the derived series or of the lower central series into E.

We extend the class of abelian groups for which a conjecture of Asai and Yoshida on the number of crossed homomorphisms holds. We also prove a general result which connects certain problems concerning divisibility in groups to the…

We prove that for every ordered abelian group $G$ there exists a non-trivial ordered abelian group $H$ such that $G\preccurlyeq H\oplus G$ with the lexicographic order, and give a first-order characterization of ordered abelian group $G$…

In this note we prove the claim given in the title. A group G is noncommutatively slender if each map from the fundamental group of the Hawaiian Earring to G factors through projection to a canonical free subgroup. Graham Higman, in his…

Given a group $G$ and an integer $n\geq2$ we construct a new group $\tilde{{\cal K}}(G,n)$. Although this construction naturally occurs in the context of finding new invariants for complex algebraic surfaces, it is related to the theory of…

Let $G$ be a group and $H\leqslant G$ a subgroup. The free extension of an $H$-subshift $X$ to $G$ is the $G$-subshift $\widetilde{X}$ whose configurations are those for which the restriction to every coset of $H$ is a configuration from…

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 study finite groups $G$ with the property that for any subgroup $M$ maximal in $G$ whose order is divisible by all the prime divisors of $|G|$, $M$ is supersolvable. We show that any nonabelian simple group can occur as a composition…

In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

The idempotent problem of a finitely generated inverse semigroup is the formal language of all words over the generators representing idempotent elements. This note proves that a finitely generated inverse semigroup with regular idempotent…

Let w be a multilinear commutator word. We prove that if e is a positive integer and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e then the exponent of the corresponding verbal subgroup…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the…