Profinite Methods in Semigroup Theory

@article{Weil2002ProfiniteMI,
  title={Profinite Methods in Semigroup Theory},
  author={Pascal Weil},
  journal={Int. J. Algebra Comput.},
  year={2002},
  volume={12},
  pages={137-177}
}
  • P. Weil
  • Published 1 February 2002
  • Mathematics
  • Int. J. Algebra Comput.
Many recent results in finite semigroup theory make use of profinite methods, that is, they rely on the study of certain infinite, compact semigroups which arise as projective limits of finite semigroups. These ideas were introduced in semigroup theory in the 1980s, first to describe pseudovarieties in terms of so-called pseudo-identities: this is Reiterman's theorem, which can be viewed as the (much more complex) finite algebra analogue of Birkhoff's variety theorem. Soon, these methods were… 
The q-theory of Finite Semigroups
Discoveries in finite semigroups have influenced several mathematical fields, including theoretical computer science, tropical algebra via matrix theory with coefficients in semirings, and other
On fixed points of the lower set operator
TLDR
This work presents a complete description of the lower set operator, an analogue of the power operator already studied in semigroup theory, and obtains large families of fixed points for this operator applied to pseudovarieties of ordered semigroups, including all examples found in the literature.
Profinite structures and dynamics
Surprising as it may be at first sight, there are a number of connections between the theories of finite semigroups and dynamical systems, both viewed in a broad sense. For instance in symbolic
Groups St Andrews 2005: Groups and semigroups: connections and contrasts
Group theory and semigroup theory have developed in somewhat different directions in the past several decades. While Cayley’s theorem enables us to view groups as groups of permutations of some set,
SYMBOLIC DYNAMICS IN FREE PROFINITE SEMIGROUPS
This is a survey and announcement of recent results on the structure of free profinite semigroups using techniques and results from symbolic dynamics. The intimate connection between uniformly
Complete reducibility of systems of equations with respect to R
It is shown that the pseudovariety R of all finite R-trivial semigroups is completely reducible with respect to the canonical signature. Informally, if the variables in a finite system of equations
Duality and Equational Theory of Regular Languages
TLDR
This paper presents a new result in the equational theory of regular languages, which emerged from lively discussions between the authors about Stone and Priestley duality, and shows for instance that any class ofregular languages defined by a fragment of logic closed under conjunctions and disjunctions admits an equational description.
ASSOCIATED WITH WEAKLY PRIMITIVE SUBSTITUTIONS
A uniformly recurrent pseudoword is an element of a free profinite semigroup in which every finite factor appears in every sufficiently long finite factor. An alternative characterization is as a
Relational semigroupoids: Abstract relation-algebraic interfaces for finite relations between infinite types
  • Wolfram Kahl
  • Mathematics
    J. Log. Algebraic Methods Program.
  • 2008
...
...

References

SHOWING 1-10 OF 159 REFERENCES
Syntactic and Global Semigroup Theory: A Synthesis Approach
This paper is the culmination of a series of work integrating syntactic and global semigroup theoretical approaches for the purpose of calculating semidirect products of pseudovarieties of
GLOBALS OF PSEUDOVARIETIES OF COMMUTATIVE SEMIGROUPS: THE FINITE BASIS PROBLEM, DECIDABILITY AND GAPS
Abstract Whereas pseudovarieties of commutative semigroups are known to be finitely based, the globals of monoidal pseudovarieties of commutative semigroups are shown to be finitely based (or of
Free Profinite ℛ-Trivial Monoids
TLDR
The structure of semigroups of implicit operations on R, the pseudovariety of all ℛ-trivial semig groups, is described by means of labeled ordinals and of labeled infinite trees of finite depth.
PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
We introduce a series of new polynomially computable implicit operations on the class of all finite semigroups. These new operations enable us to construct a finite pro-identity basis for the
The Birkhoff theorem for finite algebras
A finite analogue of the Birkhoff variety theorem is proved: a non-void class of finite algebras of a finite type τ is closed under the formation of finite products, subalgebras and homomorphic
Inverse Semigroups and Extensions of Groups by Semilattices
This paper is the first part of a series of three papers devoted to the study of inverse semigroups. The subject of our second paper [7] is free inverse semigroups, the third one [S] is dedicated to
Normal Forms for Free Aperiodic Semigroups
TLDR
This article introduces a specific and rather elementary list of pseudoidentitites, and shows that for each n, the n-generated free aperiodic semigroup is defined by this list of Pseudoidentities, and uses this identification to show that it has a decidable word problem.
...
...