Related papers: The free $F$-restriction semigroups
Let $A=A(x_{1},...,x_{n})$ be a free associative algebra in $\mathcal{A}$ freely generated over $K$ by a set $X=\{x_{1},...,x_{n}\}$, $End A$ be the semigroup of endomorphisms of $A$, and $Aut End A$ be the group of automorphisms of the…
The class of semisymmetric quasigroups is determined by the identity $(yx)y=x.$ We prove that the universal multiplication group of a semisymmetric quasigroup $Q$ is free over its underlying set and then specify the point-stabilizers of an…
In this article, we study geometric properties of nilpotent groups. We find a geometric criterion for the word problem for the finitely generated free nilpotent groups. By geometric criterion, we mean a way to determine whether two words…
In this note, we will show that the twisted convolution algebra $L^1_{\alpha,\omega}({\sf G},\mathfrak A)$ associated to a twisted action of a locally compact group ${\sf G}$ on a $C^*$-algebra $\mathfrak A$ has the following property:…
This is the second paper in a series of three, where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Here, for an arbitrary group $G$ of infinite words over an ordered abelian group…
In this paper, we obtain optimal time hypercontractivity bounds for the free product extension of the Ornstein-Uhlenbeck semigroup acting on the Clifford algebra. Our approach is based on a central limit theorem for free products of spin…
An inverse monoid $S$ is called $F$-inverse if each $\sigma$-class of $S$, where $\sigma$ is the minimum group congruence of $S$, has a maximum element with respect to the natural order of $S$. Since the property of an inverse monoid being…
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To…
We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…
Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the Cayley graph of a finite transformation semigroup with a fixed generator set. Of…
For a left cancellative monoid $S$ we consider a quotient of the reduced semigroup C$^*$-algebra $C_r^*(S)$ known as the boundary quotient. We present two potential groupoid models for this boundary quotient, obtained as reductions of…
Let $G$ be a group which admits the structure of an iterated semidirect product of finitely generated free groups. We construct a finite, free resolution of the integers over the group ring of $G$. This resolution is used to define…
Last years a number of papers were devoted to describing automorphisms of semigroups of endomorphisms of free finitely generated universal algebras of some varieties: groups, semigroups, associative commutative algebras, inverse semigroups,…
An essentially free group action of $\Gamma$ on $(X,\mu)$ is called W*-superrigid if the crossed product von Neumann algebra $L^\infty(X) \rtimes \Gamma$ completely remembers the group $\Gamma$ and its action on $(X,\mu)$. We prove…
Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes, namely the factorization conjecture and the triangle conjecture,…
Let $X$ be a finite connected graph, each of whose vertices has degree at least three. The fundamental group $\Gamma$ of $X$ is a free group and acts on the universal covering tree $\Delta$ and on its boundary $\partial \Delta$, endowed…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
We study groupoids and semigroup C*-algebras arising from graphs of monoids, in the setting of right LCM monoids. First, we establish a general criterion when a graph of monoids gives rise to a submonoid of the fundamental group which is…
Let T_n be the full transformation semigroup of all mappings from the set {1,...,n} to itself under composition. Let E = E(T_n) denote the set of idempotents of T_n and let e be an arbitrary idempotent satisfying |im(e)|=r < n-1. We prove…
Given a free product $G$, we investigate the existence of faithful free representations of the outer automorphism group $\text{Out}(G)$, or in other words of embeddings of $\text{Out}(G)$ into $\text{Out}\left(F_m\right)$ for some $m$. This…