loading...
Monoids whose Centralizer is the Least Clone
University of Toronto, Toronto, Canada May 19-May 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2004.131992734th International Symposium on Multi ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hajime Machida, Hitotsubashi University
Ivo G. Rosenberg, Université de Montréal
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 sucient 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.
Index Terms:
Clone; centralizer; monoid
Citation:
Hajime Machida, Ivo G. Rosenberg, "Monoids whose Centralizer is the Least Clone," ismvl, pp.102-108, 34th International Symposium on Multiple-Valued Logic (ISMVL'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.