We prove that a finitely presented Rees quotient of a free inverse semigroup has polynomial growth if and only if it has bounded height. This occurs if and only if the set of nonzero reduced words has bounded Shirshov height and all nonzero reduced but not cyclically reduced words are nilpotent. This occurs also if and only if the set of nonzero geodesic words have bounded Shirshov height. We also give a simple sufficient graphical condition for polynomial growth, which is necessary when all zero relators are reduced. As a final application of our results, we give an inverse semigroup analogue of a classical result that characterises polynomial growth of finitely presented Rees quotients of free semigroups in terms of primitive words that l...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
It is well known that an inverse semigroup is completely semisimple if and only if it does not conta...
AbstractWe show that if a finitely presented Rees quotient of a free inverse semigroup has polynomia...
AbstractWe show that if a finitely presented Rees quotient of a free inverse semigroup has polynomia...
AbstractWe give a sufficient condition for a finitely presented Rees quotient of a free inverse semi...
Semigroupoids are generalizations of semigroups and of small categories. In general, the quotient of...
AbstractThe problem of calculating the growth of a finitely generated (f.g.) semigroup satisfying th...
In group theory we are able to derive many properties about a group from how it acts on a graph. Kno...
AbstractFinitely generated linear semigroups S ⊆ Mn(K) of polynomial growth are described. First, we...
AbstractThe problem of calculating the growth of a finitely generated (f.g.) semigroup satisfying th...
AbstractFinitely generated subsemigroups S of the full matrix monoid Mn(K) over a field K of positiv...
Let $X$ be a set with infinite cardinality $m$ and let $B$ be the Baer-Levi semigroup, consisting of...
Let $X$ be a set with infinite cardinality $m$ and let $B$ be the Baer-Levi semigroup, consisting of...
International audienceWe study inverse semigroup amalgams [S 1 , S 2 ; U ], where S 1 and S 2 are fi...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
It is well known that an inverse semigroup is completely semisimple if and only if it does not conta...
AbstractWe show that if a finitely presented Rees quotient of a free inverse semigroup has polynomia...
AbstractWe show that if a finitely presented Rees quotient of a free inverse semigroup has polynomia...
AbstractWe give a sufficient condition for a finitely presented Rees quotient of a free inverse semi...
Semigroupoids are generalizations of semigroups and of small categories. In general, the quotient of...
AbstractThe problem of calculating the growth of a finitely generated (f.g.) semigroup satisfying th...
In group theory we are able to derive many properties about a group from how it acts on a graph. Kno...
AbstractFinitely generated linear semigroups S ⊆ Mn(K) of polynomial growth are described. First, we...
AbstractThe problem of calculating the growth of a finitely generated (f.g.) semigroup satisfying th...
AbstractFinitely generated subsemigroups S of the full matrix monoid Mn(K) over a field K of positiv...
Let $X$ be a set with infinite cardinality $m$ and let $B$ be the Baer-Levi semigroup, consisting of...
Let $X$ be a set with infinite cardinality $m$ and let $B$ be the Baer-Levi semigroup, consisting of...
International audienceWe study inverse semigroup amalgams [S 1 , S 2 ; U ], where S 1 and S 2 are fi...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
Finite automata and rational languages are fundamental concepts in theoretical computer science and ...
It is well known that an inverse semigroup is completely semisimple if and only if it does not conta...