Article
Licensed
Unlicensed
Requires Authentication
Clones determined by alternating monoids
-
S.S. Marchenkov
Published/Copyright:
February 2, 2016
Abstract
In the symmetric semigroup ℑk of all mappings from the set Ek into Ek, k ≥ 3, we consider alternating monoids, that is, monoids which contain all even permutations on Ek. For each monoid T ∈ ℑk, we define the set of all functions of Pk which preserve graphs of all permutations of T (the clone determined by the monoid T). We describe all clones determined by alternating monoids.
Published Online: 2016-2-2
Published in Print: 2002-4-1
© 2016 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Editorial
- Clones determined by alternating monoids
- Bent functions from a finite abelian group into a finite abelian group
- Transitive polynomial transformations of residue class rings
- On conditions of efficiency of a solution of a multicriteria discrete problem
- An estimate of mean efficiency of search trees for arbitrary sets of binary words
- Limit distributions of the number of collections of H -equivalent segments in the triangular array scheme of equiprobable polynomial trials
- The loops of order six
- Forthcoming Papers
- Forthcoming Papers
Articles in the same Issue
- Editorial
- Clones determined by alternating monoids
- Bent functions from a finite abelian group into a finite abelian group
- Transitive polynomial transformations of residue class rings
- On conditions of efficiency of a solution of a multicriteria discrete problem
- An estimate of mean efficiency of search trees for arbitrary sets of binary words
- Limit distributions of the number of collections of H -equivalent segments in the triangular array scheme of equiprobable polynomial trials
- The loops of order six
- Forthcoming Papers
- Forthcoming Papers
