Related papers: A note on doubles of groups
Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…
We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which seem to be necessary to make the…
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 show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
Which groups can be the group of units in a ring? This open question, posed by L\'{a}szl\'{o} Fuchs in 1960, has been studied by the authors and others with a variety of restrictions on either the class of groups or the class of rings under…
We study the impact of certain identities and probabilistic identities on the structure of finite groups. More specifically, let $w$ be a nontrivial word in $d$ distinct variables and let $G$ be a finite group for which the word map…
In this note we describe the finite groups $G$ having $|G|-2$ cyclic subgroups. This partially solves the open problem in the end of \cite{3}.
We present a necessary condition for an infinite language to be multiple context-free, which we call a Substitution Lemma. We apply it to show a sample selection of languages are not multiple context-free, including the word problem of the…
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…
This paper classifies the factorizations of almost simple groups with a factor having at least two nonsolvable composition factors. This together with a previous classification result of the authors reduces the factorization problem of…
We describe the fully residually F; or limit groups relative to F; (where F is a free group) that arise from systems of equations in two variables over F that have coefficients in F.
A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…
The duality principle for Gabor frames states that a Gabor sequence obtained by a time-frequency lattice is a frame for $L^{2}(\R^{d})$ if and only if the associated adjoint Gabor sequence is a Riesz sequence. We prove that this duality…
We characterize the squares occurring in infinite overlap-free binary words and construct various alpha power-free binary words containing infinitely many overlaps.
Let w be a group word. It is conjectured that if w has only countably many values in a profinite group G, then the verbal subgroup w(G) is finite. In the present paper we confirm the conjecture in the cases where w is a multilinear…
In this paper, we investigate problems which are dual to the unification problem, namely the Fixed Point (FP) problem, Common Term (CT) problem and the Common Equation (CE) problem for string rewriting systems. Our main motivation is…
In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…
The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…
The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…