Related papers: The free $F$-restriction semigroups

Let $\Sigma = X\cup X^{-1} = \{ x_1 ,x_2 ,..., x_m ,x_1^{-1} ,x_2^{-1} ,..., x_m^{-1} \}$ and let $G$ be a group with set of generators $\Sigma$. Let $\mathfrak{L} (G) =\left\{ \left. \omega \in \Sigma^* \; \right\vert \;\omega \equiv e \;…

We use topological methods to study the maximal subgroups of the free idempotent generated semigroup on a biordered set. We use these to give an example of a free idempotent generated semigroup with maximal subgroup isomorphic to the free…

We prove that the boundary dynamics of the (semi)group generated by the enriched dual transducer characterizes the algebraic property of being free for an automaton group. We specialize this result to the class of bireversible transducers…

In this article, we consider actions of \mathcal{Z}_+^d, \mathcal{R}_+^d and finitely generated free groups on a von Neumann algebras $M$ and prove a version of maximal ergodic inequality. Additionally, we establish non-commutative…

Let $\Lambda^{\ast}$ be the free monoid of (finite) words over a not necessarily finite alphabet $\Lambda$, which is equipped with some (partial) order. This ordering lifts to $\Lambda^{\ast}$, where it extends the divisibility ordering of…

An infinite graph G is minor excluded if there is a finite graph that is not a minor of G. We prove that minor excluded graphs have finite Assouad-Nagata dimension and study minor exclusion for Cayley graphs of finitely generated groups.…

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

Let $\A$ be a finitely generated semigroup with 0. An $\A$-module over $\fun$ (also called an $\A$--set), is a pointed set $(M,*)$ together with an action of $\A$. We define and study the Hall algebra $\H_{\A}$ of the category $\C_{\A}$ of…

We discuss the half-liberation operation $X\to X^*$, for the algebraic submanifolds of the unit sphere, $X\subset S^{N-1}_\mathbb C$. There are several ways of constructing this correspondence, and we take them into account. Our main…

Let $K$ be a field, let $\sigma$ be an automorphism of $K$, and let $\delta$ be a derivation of $K$. We show that if $D$ is one of $K(x;\sigma)$ or $K(x;\delta)$, then $D$ either contains a free algebra over its center on two generators, or…

We study the intersection of finitely generated subgroups of free groups by utilizing the method of linear programming. We prove that if $H_1$ is a finitely generated subgroup of a free group $F$, then the WN-coefficient $\sigma(H_1)$ of…

Extensions of the minimal supersymmetric standard model (MSSM) gauge group abound in the literature. Several of these include an additional $U(1)_X$ gauge group. Chiral fermions' charge assignments under $U(1)_X$ are constrained to cancel…

We introduce an algebraic extension $\boldsymbol{B}_{\omega}^{\mathscr{F}}$ of the bicyclic monoid for an arbitrary $\omega$-closed family $\mathscr{F}$ subsets of $\omega$ which generalizes the bicyclic monoid, the countable semigroup of…

We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…

To factorize and to decompose the graphs of representative functions on the free monoid X * (generated by the alphabet X ) with values in the ring A containing Q, we examine various products of series (as concatenation, shuffle and its…

Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a…

Let $F_n$ be the free group on $n \geq 2$ generators. We show that for all $1 \leq m \leq 2n-3$ (respectively for all $1 \leq m \leq 2n-4$) there exists a subgroup of $\operatorname{Aut}(F_n)$ (respectively $\operatorname{Out}(F_n)$) which…

We introduce and investigate a class of profinite groups defined via extensions of centralizers analogous to the extensively studied class of finitely generated fully residually free groups, that is, limit groups (in the sense of Z. Sela).…

Spielberg's construction of C*-algebras from left cancellative small categories is a common generalization for most C*-algebras one would consider to come from ``combinatorial data,'' including graph and $k$-graph C*-algebras, Li's…

We consider certain decision problems for the free model of the theory of Cartesian monoids. We introduce a model of computation based on the notion of a single stack one-way PDA due to Ginsburg, Greibach and Harrison. This model allows us…