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

Let $G$ be a group. Associate a directed graph $\vec{E}(G)$ (called the Engel digraph of $G$) with $G$ whose vertex set is $G$, with an arc $(x,y)$ if $[y, {}_k x]=1$ for some positive integer $k$, where $[y,{}_kx]$ is the iterated…

Let $G$ be a non-abelian group and $Z(G)$ be the center of $G$. Associate a graph $\Gamma_G$ (called non-commuting graph of $G$) with $G$ as follows: take $G\setminus Z(G)$ as the vertices of $\Gamma_G$ and join two distinct vertices $x$…

Nearly $60$ years ago, L\'{a}szl\'{o} Fuchs posed the problem of determining which groups can be realized as the group of units of a commutative ring. To date, the question remains open, although significant progress has been made. Along…

The deterministic membership problem for timed automata asks whether the timed language given by a nondeterministic timed automaton can be recognised by a deterministic timed automaton. An analogous problem can be stated in the setting of…

Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…

In general the endomorphisms of a non-abelian group do not form a ring under the operations of addition and composition of functions. Several papers have dealt with the ring of functions defined on a group which are endomorphisms when…

A completely nonintegrable $2$-dimensional distribution on a $4$-manifold is called an Engel structure. A $4$-manifold with an Engel structure is called an Engel manifold. The developing map for an Engel manifold is very important tool to…

Let $G$ be a group. Let $X$ be a connected algebraic group over an algebraically closed field $K$. Denote by $A=X(K)$ the set of $K$-points of $X$. We study a class of endomorphisms of pro-algebraic groups, namely algebraic group cellular…

The \emph{Entscheidungsproblem}, or the classical decision problem, asks whether a given formula of first-order logic is satisfiable. In this work, we consider an extension of this problem to regular first-order \emph{theories}, i.e.,…

Let $w \in F_2$ be a word and let $m$ and $n$ be two positive integers. We say that a finite group $G$ has the $w_{m,n}$-property if however a set $M$ of $m$ elements and a set $N$ of $n$ elements of the group is chosen, there exist at…

Let $q$ be a prime and $A$ an elementary abelian $q$-group acting as a coprime group of automorphisms on a profinite group $G$. We show that if $A$ is of order $q^2$ and some power of each element in $C_G(a)$ is Engel in $G$ for any $a\in…

The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…

The Tits alternative states that a finitely generated matrix group either contains a nonabelian free subgroup $F_2$, or it is virtually solvable. This paper considers two decision problems in virtually solvable matrix groups: the Identity…

The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…

We establish an uncountable amenable ergodic Roth theorem, in which the acting group is not assumed to be countable and the space need not be separable. This generalizes a previous result of Bergelson, McCutcheon and Zhang, and complements…

In \cite[Problem 72]{Fuchs60} Fuchs posed the problem of characterizing the groups which are the groups of units of commutative rings. In the following years, some partial answers have been given to this question in particular cases. In a…

We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…

This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…

We study systems of polynomial equations in several classes of finitely generated rings and algebras. For each ring $R$ (or algebra) in one of these classes we obtain an interpretation by systems of equations of a ring of integers $O$ of a…

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.