Related papers: Algorithmic decidability of Engel's property for a…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Recent investigations on the set of commutators between the elements of a finite group having relatively prime orders have prompt us to propose a variant of the Ore conjecture: For every finite non-abelian simple group and for every $g\in…

In algebraic number theory, the finiteness of the Picard group of an order in a number field is generally proved via a lattice argument: the order forms a lattice and every ideal class contains an integral ideal with a small enough non-zero…

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

For an element $g$ in a group $X$, we say that $g$ has 2-part order $2^{a}$ if $2^{a}$ is the largest power of 2 dividing the order of $g$. We prove lower bounds on the proportion of elements in finite classical groups in odd characteristic…

The element distinctness problem is the problem of determining whether the elements of a list are distinct, that is, if $x=(x_1,...,x_N)$ is a list with $N$ elements, we ask whether the elements of $x$ are distinct or not. The solution in a…

We define the notion of a separable element in a finite Weyl group, generalizing the well-studied class of separable permutations. We prove that the upper and lower order ideals in weak Bruhat order generated by a separable element are…

The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…

We consider the actions of different groups G on the space M of m x n matrices with entries in the formal power series ring K[[x1,..., xs]], K an arbitrary field. G acts on M by analytic change of coordinates, combined with the…

The main purpose of this paper is to develop new algorithms for computing invariant rings in a general setting. This includes invariants of nonreductive groups but also of groups acting on algebras over certain rings. In particular, we…

We exhibit infinite, solvable, virtually abelian groups with a fixed number of generators, having arbitrarily large balls consisting of torsion elements. We also provide a sequence of 3-generator non-virtually nilpotent polycyclic groups of…

The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

Let $G$ be a profinite group in which for every element $x\in G$ there exists a natural number $q=q(x)$ such that $x^q$ is Engel. We show that $G$ is locally virtually nilpotent. Further, let $p$ be a prime and $G$ a finitely generated…

Myasnikov, Ushakov, and Won introduced power circuits in 2012 to construct a polynomial-time algorithm for the word problem in the Baumslag group, which has a non-elementary Dehn function. Power circuits are computational structures that…

Let m,n be positive integers, v a multilinear commutator word and w=v^m. We prove that if G is an orderable group in which all w-values are n-Engel, then the verbal subgroup v(G) is locally nilpotent. We also show that in the particular…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next input letter so that if the overall input word admits some…

Let $R_n(G)$ denotes the set of all right $n$-Engel elements of a group $G$. We show that in any group $G$ whose 5th term of lower central series has no element of order 2, $R_3(G)$ is a subgroup. Furthermore we prove that $R_4(G)$ is a…

Let $G$ be a finite group and $\psi(G)=\sum_{g\in{G}}{o(g)}$. There are some results about the relation between $\psi(G)$ and the structure of $G$. For instance, it is proved that if $G$ is a group of order $n$ and…