DocumentCode :
3266855
Title :
Monoids whose centralizer is the least clone
Author :
Machida, Hajime ; Rosenberg, Ivo G.
Author_Institution :
Dept. of Math., Hitotsubashi Univ., Tokyo, Japan
fYear :
2004
fDate :
19-22 May 2004
Firstpage :
102
Lastpage :
108
Abstract :
For a monoid M of k-valued unary functions, the centralizer M* is the set of k-valued multi-variable functions which commute with every function in M. In this paper, we consider the problem of finding monoids whose centralizer is the least clone. First we give a sufficient condition for M to have the least clone as its centralizer and show how it can be applied to some concrete examples of M. Then we use Zadori´s theorem to obtain another condition for M to satisfy this property.
Keywords :
group theory; Zadori´s theorem; centralizer; function commutation; least clone; monoids; multiple-variable functions; unary functions; Cloning; Concrete; Ink; Lattices; Mathematics; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 2004. Proceedings. 34th International Symposium on
ISSN :
0195-623X
Print_ISBN :
0-7695-2130-4
Type :
conf
DOI :
10.1109/ISMVL.2004.1319927
Filename :
1319927
Link To Document :
بازگشت