[en] An n-variable associative function is called reducible if it can be
written as a composition of a binary associative function. In this paper we
summarize the known results when the function is defined on a chain and nondecreasing.
The main result of this paper shows that associative idempotent
and nondecreasing functions are uniquely reducible.
Disciplines :
Mathématiques
Auteur, co-auteur :
KISS, Gergely ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
Somlai, Gabor; Eotvos Lorand University Budapest > Algebra
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
Associative idempotent nondecreasing functions are reducible
