Related papers: On finite complete rewriting systems and large sub…

In this paper we show that the irreducible representations of a finite inverse semigroup $S$ over an algebraically closed field $F$ are in bijection with the conjugacy classes of $S$ if the characteristic of $F$ is zero or a prime number…

A subgroup $H$ of a group $G$ is called weakly s-supplemented in $G$ if there is a subgroup $T$ such that $G=HT$ and $H\cap T\le H_{sG}$, where $H_{sG}$ is the subgroup of $H$ generated by all those subgroups of $H$ which are s-permutable…

We prove that finite index subgroups in S-arithmetic Chevalley groups are bounded.

In this work we present algebraic conditions on an inverse semigroup S (with zero) which imply that its associated tight groupoid G_{tight)(S) is: Hausdorff, essentially principal, minimal and contracting, respectively. In some cases these…

We call a restriction semigroup almost perfect if it is proper and its least monoid congruence is perfect. We show that any such semigroup is isomorphic to a `$W$-product' $W(T,Y)$, where $T$ is a monoid, $Y$ is a semilattice and there is a…

Let $\mathcal C$ be a class of topological semigroups. A semigroup $X$ is called $absolutely$ $\mathcal C$-$closed$ if for any homomorphism $h:X\to Y$ to a topological semigroup $Y\in\mathcal C$, the image $h[X]$ is closed in $Y$. Let…

We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…

Given a semigroup $S$, we introduce relative (with respect to a filter $\tau$ on $S$) versions of large, thick and prethick subsets of $S$, give the ultrafilter characterizations of these subsets and explain how large could be some cell in…

We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…

Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving…

A profinite group is called small if it has only finitely many open subgroups of index n for each positive integer n. We show that every Frattini cover of a small profinite group is small. A profinite group is called strongly complete if…

Let $w$ be a multilinear commutator word. In the present paper we describe recent results that show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely (or in some cases countably) many subgroups…

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

Let $\mathbb{Z}$ be the additive (semi)group of integers. We prove that for a finite semigroup $S$ the direct product $\mathbb{Z}\times S$ contains only countably many subdirect products (up to isomorphism) if and only if $S$ is regular. As…

Productivity is the property that finite prefixes of an infinite constructor term can be computed using a given term rewrite system. Hitherto, productivity has only been considered for orthogonal systems, where non-determinism is not…

Let $\mathcal{A}$ be a finite set of integers, and let $h\mathcal{A}$ denote the $h$-fold sumset of $\mathcal{A}$. Let $(h\mathcal{A})^{(t)}$ be subset of $h\mathcal{A}$ consisting of all integers that have at least $t$ representations as a…

A conjecture of Dehornoy claims that, given a presentation of an Artin-Tits group, every word that represents the identity can be transformed into the trivial word using the braid relations, together with certain rules (between pairs of…

A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language of terms that is closed under rewriting and does not contain normal forms. It is automated by representing the…

Let $S$ be an algebraic semigroup (not necessarily linear) defined over a field $F$. We show that there exists a positive integer $n$ such that $x^n$ belongs to a subgroup of $S(F)$ for any $x \in S(F)$. In particular, the semigroup $S(F)$…

Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…