相关论文: A note on doubles of groups

We study the computational complexity of the Word Problem (WP) in free solvable groups $S_{r,d}$, where $r \geq 2$ is the rank and $d \geq 2$ is the solvability class of the group. It is known that the Magnus embedding of $S_{r,d}$ into…

Let $P(G)$ denotes the set of sizes of fibers of non-trivial commutators of the commutator word map. Here, we prove that $|P(G)|=1$, for any finite group $G$ of nilpotency class $3$ with exactlly two conjugacy class sizes. We also show that…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

As a result of impressive research arXiv:2106.07231, D. Garc\'{\i}a-Lucas, \'{A}. del R\'{i}o and L. Margolis defined an infinite series of non-isomorphic $2$-groups $G$ and $H$, whose group algebras $\mathbb{F}G$ and $\mathbb{F}H$ over the…

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

It is proved that generalized free product of two finite p-groups is a conjugacy p-separable group if and only if it is residually finite p-groups. This result is then applied to establish some sufficient conditions for conjugacy…

Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…

We introduced the notation of a set of prohibitions and give definitions of a complete set and a crucial word with respect to a given set of prohibitions. We consider 3 particular sets which appear in different areas of mathematics and for…

In 1960, L\'{a}szl\'{o} Fuchs posed the problem of determining which groups $G$ are realizable as the group of units in some ring $R$. In \cite{chebolu2022fuchs}, we investigated the following variant of Fuchs' problem, for abelian groups:…

We prove new separability results about free groups. Namely, if $H_1, \ldots , H_k$ are infinite index, finitely generated subgroups of a non-abelian free group $F$, then there exists a homomorphism onto some alternating group $f:F…

This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…

We prove that the finitely presentable subgroups of residually free groups are separable and that the subgroups of type $\mathrm{FP}_\infty$ are virtual retracts. We describe a uniform solution to the membership problem for finitely…

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…

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

The square-free word problem relative to a system of two defining relations is decidable.

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…

We provide a list of (mainly unsolved) problems in ordered and orderable groups. These were originally compiled 10 years ago by the last two authors. New problems have been added to the list. Progress on some of these is noted and…