pith. sign in

arxiv: 1104.2301 · v1 · pith:WEXRUMJFnew · submitted 2011-04-12 · 🧮 math.GR · cs.FL

Geometric Semigroup Theory

Jon McCammond , John Rhodes , Benjamin Steinberg This is my paper
classification 🧮 math.GR cs.FL
keywords semigroupfinitesemigroupsautomatageometricgraphtheoryacts
0
0 comments X
read the original abstract

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups and automata lead to simplifications of the graphs on which the corresponding finite semigroups act. We show in particular that every finite semigroup can be finitely expanded so that the expansion acts on a labeled directed graph which resembles the right Cayley graph of a free Burnside semigroup in many respects.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Decidability of Krohn-Rhodes complexity $c = 1$ of finite semigroups and automata

    math.GR 2021-10 unverdicted novelty 7.0

    Proves that Krohn-Rhodes complexity c=1 is decidable for finite semigroups and automata via profinite methods and prior lower-bound results.