Related papers: On generalisations of conciseness

A subgroup $\Delta\leq \Gamma$ is commensurated if $|\Delta:\Delta\cap \gamma\Delta\gamma^{-1}|<\infty$ for all $\gamma\in \Gamma$. We show a finitely generated branch group is just infinite if and only if every commensurated subgroup is…

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…

Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…

Given a group $G$, we write $x^G$ for the conjugacy class of $G$ containing the element $x$. A famous theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the derived group…

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

We apply the method of Arzhantseva-Ol'shanskii to prove that for an exponentially generic (in the sense of Ol'shanskii) class of one-relator groups the isomorphism problem is solvable in at most exponential time. This is obtained as a…

Let $G$ be a non-elementary hyperbolic group. Let $w$ be a group word such that the set $w[G]$ of all its values in $G$ does not coincide with $G$ or 1. We show that the width of verbal subgroup $w(G)=<w[G]>$ is infinite. That is, there is…

We show that for any Polish group $G$ and any countable normal subgroup $\Gamma\triangleleft G$, the coset equivalence relation $G/\Gamma$ is a hyperfinite Borel equivalence relation. In particular, the outer automorphism group of any…

Let $G$ be an arbitrary group such that $G/\Z(G)$ is finite, where $\Z(G)$ denotes the center of the group $G$. Then $\gamma_2(G)$, the commutator subgroup of $G$, is finite. This result is known as Shur's theorem (the Schur's theorem). In…

We further develop the theory of layered semigroups, as introduced by Farah, Hindman and McLeod, providing a general framework to prove Ramsey statements about such a semigroup $S$. By nonstandard and topological arguments, we show Ramsey…

In a recent article (2022) we proved with L. Zaj\'i\v{c}ek that if $ G\subset\R^n $ is an unbounded open convex set that does not contain a translation of a convex cone with non-empty interior, then there exist $ f:G\to\R $ and a concave…

We introduce the space function $s(n)$ of a finitely presented semigroup $S =<A\mid R>.$ To define $s(n)$ we consider pairs of words $w,w'$ over $A$ of length at most $n$ equal in $S$ and use relations from $R$ for the transformations…

$H$ is called a $G$-subgroup of a hyperbolic group $G$ if for any finite subset $M\subset G$ there exists a homomorphism from $G$ onto a non-elementary hyperbolic group $G_1$ that is surjective on $H$ and injective on $M$. In his paper in…

We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…

We consider profinite groups in which all commutators are contained in a union of finitely many procyclic subgroups. It is shown that if G is a profinite group in which all commutators are covered by m procyclic subgroups, then G possesses…

To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same…

Let $G$ be a finite group, define $I(G)=\{x\in G : x^{2}=1\}$, $C(G)=$ set of the cyclic subgroups of $G$, $i(G)=|I(G)|$ and $c(G)=|C(G)|$. In this article, we will classify finite groups with $i(G)=c(G)-r$ for $r=0,1,$ and $2$. We also…

A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…

Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…

Let $f_W(n)$ be the number of different factors of length $n$ appearing in $W$. A classical result of Morse and Hedlund, stated in 1938, asserts that an infinite word $W$ is ultimately periodic if and only if $f_W(n)\leq n$ for some $n\in…