Related papers: On epiC groups over language class C

The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…

We prove group existence and structure theorems in a general setting of tame topological theories. More precisely, we identify a linear/non-linear dividing line -- called topological 1-basedness -- among the class of t-minimal theories with…

Suppose that a finite $p$-group $P$ admits a Frobenius group of automorphisms $FH$ with kernel $F$ that is a cyclic $p$-group and with complement $H$. It is proved that if the fixed-point subgroup $C_P(H)$ of the complement is nilpotent of…

A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…

In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…

The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…

Let V be a variety of algebras of some type. An interest to describing automorphisms of the category C of finitely generated free V-algebras was inspired in connection with development of universal algebraic geometry founded by B. Plotkin.…

It is shown that every separable abelian topological group is isomorphic with a topological subgroup of a monothetic group (that is, a topological group with a single topological generator). In particular, every separable metrizable abelian…

We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…

A ring R is called an E-ring if the canonical homomorphism from R to the endomorphism ring End(R_Z) of the additive group R_Z, taking any r in R to the endomorphism left multiplication by r turns out to be an isomorphism of rings. In this…

Given a group-word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. The word $w$ is concise if $w(G)$ is finite for all groups $G$ in which $G_w$ is finite.…

The word problem of a finitely generated group is the formal language of words over the generators which are equal to the identity in the group. If this language happens to be context-free, then the group is called context-free. Finitely…

We show that, given an equation over a finitely generated free group, the set of all solutions in reduced words forms an effectively constructible EDT0L language. In particular, the set of all solutions in reduced words is an indexed…

Let $\mathcal C$ be a class of Hausdorff topological semigroups which contains all zero-dimensional Hausdorff topological semigroups. A semigroup $X$ is called $\mathcal C$-$closed$ if $X$ is closed in each topological semigroup $Y\in…

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected…

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…

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…

When we investigate a type system, it is helpful if we can establish the well-foundedness of types or terms with respect to a certain hierarchy, and the Extended Calculus of Constructions (called $ECC$, defined and studied comprehensively…