Related papers: On epiC groups over language class C

We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…

In this article we show that every group with a finite presentation satisfying one or both of the small cancellation conditions $C'(1/6)$ and $C'(1/4)-T(4)$ has the property that the set of all geodesics (over the same generating set) is a…

We study groups whose co-word problems are ET0L languages, which we call coET0L groups, using an automaton based model due to van Leeuwen, and recently studied by Bishop and Elder. In particular we prove a number of closure results for the…

We define a notion of relative soficity for countable groups with respect to a family of groups. A group is sofic if and only if it is relative sofic with respect to the family consisting only of the trivial group. If a group is relatively…

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$. In the present paper we consider profinite groups admitting a word $w$ such that the…

We study the language-theoretic properties of the word problem, in the sense of Duncan & Gilman, of weakly compressible monoids, as defined by Adian & Oganesian. We show that if $\mathcal{C}$ is a reversal-closed super-$\operatorname{AFL}$,…

Epistemic logics of intensional groups lift the assumption that membership in a group of agents is common knowledge. Instead of being represented directly as a set of agents, intensional groups are represented by a property that may change…

Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We…

In this article, we introduce an interesting topology-like concept concerning groups (and with almost the same method it can be defined for other algebraic systems). Given an arbitrary group $G$, we define a {\em topo-system} on $G$ as a…

A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…

A topological group is (openly) almost-elliptic if it contains a(n open) dense subset of elements generating relatively-compact cyclic subgroups. We classify the (openly) almost-elliptic connected locally compact groups as precisely those…

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…

Suppose that a finite group $G$ admits a Frobenius group of automorphisms FH of coprime order with cyclic kernel F and complement H such that the fixed point subgroup $C_G(H)$ of the complement is nilpotent of class $c$. It is proved that…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

Let S be a generating set of a group G. We say that G has FINITE WIDTH relative to S if G=(S\cup S^{-1})^k for a suitable natural number k. We say that a group G is a group of FINITE C-WIDTH if G has finite width with respect to all…

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

Given a group $G$ and a family of subgroups $\mathcal{F}$, we consider its classifying space $E_{\mathcal F}G$ with respect to $\mathcal{F}$. When $\mathcal F = \mathcal{VC}yc$ is the family of virtually cyclic subgroups, Juan-Pineda and…

In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. The two main results of the paper are the following. First, we…