نتایج جستجو برای: inverse semigroups

تعداد نتایج: 97271  

2011
MARK V. LAWSON

A pseudogroup is a complete infinitely distributive inverse monoid. Such inverse monoids bear the same relationship to classical pseudogroups of transformations as frames do to topological spaces. The goal of this paper is to develop the theory of pseudogroups motivated by applications to group theory, C∗-algebras and aperiodic tilings. Our starting point is an adjunction between a category of ...

Journal: :IJAC 2013
David Easdown Lev M. Shneerson

We study the asymptotic behaviour of a finitely presented Rees quotient S = Inv〈A | ci = 0 (i = 1, . . . , k) 〉 of a free inverse semigroup over a finite alphabet A. It is shown that if the semigroup S has polynomial growth then S is monogenic (with zero) or k ≥ 3. The three relator case is fully characterised, yielding a sequence of two-generated three-relator semigroups whose Gelfand-Kirillov...

Journal: :CoRR 2016
Daniele D'Angeli Emanuele Rodaro Jan Philipp Wächter

In this paper, we study the word problem of automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSpace...

2010
JONATHON FUNK PIETER HOFSTRA

We define the notion of a torsor for an inverse semigroup, which is based on semigroup actions, and prove that this is precisely the structure classified by the topos associated with an inverse semigroup. Unlike in the group case, not all set-theoretic torsors are isomorphic: we shall give a complete description of the category of torsors. We explain how a semigroup prehomomorphism gives rise t...

2011
Emanuele Rodaro Pedro V. Silva

We show that the word problem for an amalgam [S1, S2;U,ω1, ω2] of inverse semigroups may be undecidable even if we assume S1 and S2 (and therefore U) to have finite R-classes and ω1, ω2 to be computable functions, interrupting a series of positive decidability results on the subject. This is achieved by encoding into an appropriate amalgam of inverse semigroups 2-counter machines with sufficien...

2004
Peter R. Jones Z. J. Tian

We generalize to eventually regular (or ‘π-regular’) semigroups the study of the lattice of full regular subsemigroups of a regular semigroup, which has its most complete exposition in the case of inverse semigroups. By means of a judicious definition, it is shown that the full eventually regular subsemigroups of such a semigroup form a complete lattice LF , which projects onto the lattices of ...

Journal: :Bulletin of the Australian Mathematical Society 1982

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید