Reference : Associative idempotent nondecreasing functions are reducible
Scientific journals : Article
Physical, chemical, mathematical & earth Sciences : Mathematics
http://hdl.handle.net/10993/34510
Associative idempotent nondecreasing functions are reducible
English
Kiss, Gergely mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
Somlai, Gabor [Eotvos Lorand University Budapest > Algebra]
Oct-2017
Semigroup Forum
Springer
Yes (verified by ORBilu)
0037-1912
1432-2137
New York
Germany
[en] n-ary semigroup ; associativity ; reducible ; idempotent ; quasitrivial ; extremal
[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.
http://hdl.handle.net/10993/34510
10.1007/s00233-018-9973-y
https://link.springer.com/article/10.1007/s00233-018-9973-y

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
1. Assoc_Nondecr_Idemp_Reduc.pdfPublisher postprint292.62 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.