Article (Scientific journals)
Associative idempotent nondecreasing functions are reducible
Kiss, Gergely; Somlai, Gabor
2017In Semigroup Forum
Peer Reviewed verified by ORBi
 

Files


Full Text
1. Assoc_Nondecr_Idemp_Reduc.pdf
Publisher postprint (299.64 kB)
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
n-ary semigroup; associativity; reducible; idempotent; quasitrivial; extremal
Abstract :
[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 :
Mathematics
Author, co-author :
Kiss, Gergely ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
Somlai, Gabor;  Eotvos Lorand University Budapest > Algebra
External co-authors :
yes
Language :
English
Title :
Associative idempotent nondecreasing functions are reducible
Publication date :
October 2017
Journal title :
Semigroup Forum
ISSN :
1432-2137
Publisher :
Springer, New York, Germany
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBilu :
since 08 February 2018

Statistics


Number of views
54 (8 by Unilu)
Number of downloads
70 (3 by Unilu)

Scopus citations®
 
6
Scopus citations®
without self-citations
5
OpenCitations
 
5
WoS citations
 
5

Bibliography


Similar publications



Contact ORBilu