Related papers: Semigroup Identities, Proofs, and Artificial Intel…
In this paper, we consider the following problem: For every positive integer $r \geq 2$, find all positive integers $n$ such that for every semigroup of order $\geq n$ in which $x^r=x$ for every element $x$ has a subsemigroup of order $n$.
We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.
We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…
In the work we investigate some groupoids which are the Abelian algebras and the Hamiltonian algebras. An algebra is Abelian if for every polynomial operation and for all elements $a,b,\bar c,\bar d$ the implication $t(a,\bar c)=t(a,\bar…
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…
A subset $X$ of an Abelian group $G$ is called $semiaf\!fine$ if for every $x,y,z\in X$ the set $\{x+y-z,x-y+z\}$ intersects $X$. We prove that a subset $X$ of an Abelian group $G$ is semiaffine if and only if one of the following…
We determine the maximal pseudovarieties of finite semigroups that satisfy an identity of the form $x_1 \dots x_n \approx \rho(x_1, \dots, x_n)$. Applying this classification, we further show that a pseudovariety of permutative semigroups…
We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…
There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or…
We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…
Cayley's theorem tells us that all groups $\mathbf{G}$ occur as subgroups of the group of automorphisms over some set $X$. In this paper we consider a `sort-of' converse to this question: given a set $X$ and some transformation group…
Friedl and L\"oh (2021, Confl. Math.) prove that testing whether or not there is an epimorphism from a finitely presented group to a virtually cyclic group, or to the direct product of an abelian and a finite group, is decidable. Here we…
Abelian categories provide a self-dual axiomatic context for establishing homomorphism theorems (such as the isomorphism theorems and homological diagram lemmas) for abelian groups, and more generally, modules. In this paper we describe a…
Among other things, we prove that the group of automorphisms fixing every normal subgroup of a nilpotent-by-abelian group is nilpotent-by-metabelian. In particular, the group of automorphisms fixing every normal subgroup of a metabelian…
In this article we introduce the notion of weak identities in a group and study their properties. We show that weak identities have some similar properties to ordinary ones. We use this notion to prove that any finitely generated solvable…
We continue our work (started in ``Multiplicity-free representations of algebraic groups", arXiv:2101.04476), on the program of classifying triples $(X,Y,V)$, where $X,Y$ are simple algebraic groups over an algebraically closed field of…
A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
Chevalley's theorem states that every smooth connected algebraic group over a perfect field is an extension of an abelian variety by a smooth connected affine group. That fails when the base field is not perfect. We define a pseudo-abelian…
A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…