Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Semigroup Forumarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Semigroup Forum
Article . 1997 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article . 1997
Data sources: zbMATH Open
versions View all 2 versions
addClaim

Unary Iterative Hyperidentities for Semigroups and Inverse Semigroups

Unary iterative hyperidentities for semigroups and inverse semigroups
Authors: Cowan, D.; Wismath, S. L.;

Unary Iterative Hyperidentities for Semigroups and Inverse Semigroups

Abstract

Unary iterative hyperidentities (u.i.h.) are conditions of the form \(F^a(x)=F^{a+b}(x)\), where \(F\) is a unary operation symbol, and \(a,b\geq 1\). Let \(V_{n,m}\) denote the variety of [inverse] semigroups defined by the identity \(x^n=x^{n+m}\). For each u.i.h., the largest variety of [inverse] semigroups satisfying it is found; the variety is one of \(V_{n,m}\), except for one special case for inverse semigroups. For each variety of [inverse] semigroups \(V_{n,m}\), the minimal (i.e. the strongest) u.i.h. holding in it is found.

Related Organizations
Keywords

varieties of semigroups, Free semigroups, generators and relations, word problems, varieties of inverse semigroups, iterative hyperidentities, Varieties and pseudovarieties of semigroups, Inverse semigroups

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!