Related papers: The free $F$-restriction semigroups

Let G be a simple, simply connected algebraic group defined over an algebraically closed field k of positive characteristic p. Let \sigma:G->G be a strict endomorphism (i. e., the subgroup G(\sigma) of \sigma-fixed points is finite). Also,…

We introduce the concept of a restriction semigroupoid S, which unifies the notion of restriction semigroups and restriction categories within a single structure. We prove a representation theorem, showing that every restriction…

W.~Magnus' representations of submonoids $ E \leq \mbox{End}(F) $ of the endomorphisms of a free group $ F $ of finite rank are generalised by identifying them with the first homology group of $ F $ with particular coefficient modules. By…

We consider certain positive definite functions on a finitely generated free group G that are defined with respect to a given basis in terms of word length and the number of negative-to-positive generator exponent switches. Some of these…

We study the generic properties of finitely presented monoids and semigroups. We show that for positive integers a > 1, k and m, the generic a-generator k-relation monoid and semigroup presentation (defined in any of several definite…

Every countable directed graph generates a Fock space Hilbert space and a family of partial isometries. These operators also arise from the left regular representations of free semigroupoids derived from directed graphs. We develop a…

We show that, for many choices of finite tuples of generators $X = (x_1, \dots , x_d)$ of a tracial von Neumann algebra $(M, \tau)$ satisfying certain decomposition properties (non-primeness, possessing a Cartan subalgebra, or property…

In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing the structure of a finite semigroup from a generating set. As was the case with the original algorithm of Froidure and Pin, the algorithms presented…

We study the semigroup $\boldsymbol{B}_{\omega}^{\mathscr{F}}$, which is introduced in the paper [O. Gutik and M. Mykhalenych, \emph{On some generalization of the bicyclic monoid}, Visnyk Lviv. Univ. Ser. Mech.-Mat. \textbf{90} (2020),…

A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

We prove that for a number field $F$, the distribution of the points of a set $\Sigma \subset \mathbb{A}_F^n$ with a purely exponential parametrization, for example a set of matrices boundedly generated by semi-simple (diagonalizable)…

We consider group measure space II$_1$ factors $M=L^{\infty}(X)\rtimes\Gamma$ arising from Bernoulli actions of ICC property (T) groups $\Gamma$ (more generally, of groups $\Gamma$ containing an infinite normal subgroup with relative…

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^(1+epsilon) where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

We study gauge symmetry in F-theory in light of global aspects. For this, we consider not only a simple (local) group, but also a semi-simple group with Abelian factors. Once we specify the complete gauge group by decomposing the…

We give a new definition of the semigroup C*-algebra of a left cancellative semigroup, which resolves problems of the construction by X. Li. Namely, the new construction is functorial, and the independence of ideals in the semigroup does…

We introduce a notion of "freely braided element" for simply laced Coxeter groups. We show that an arbitrary group element $w$ has at most $2^{N(w)}$ commutation classes of reduced expressions, where $N(w)$ is a certain statistic defined in…

We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also happens to be idempotent. All of our proofs have been…

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…