Associative idempotent nondecreasing functions are reducible

Reference : Associative idempotent nondecreasing functions are reducible


	Document type :	Scientific journals : Article
	Discipline(s) :	Physical, chemical, mathematical & earth Sciences : Mathematics
	To cite this reference:	http://hdl.handle.net/10993/34510

Title :	Associative idempotent nondecreasing functions are reducible
Language :	English
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]
Publication date :	Oct-2017
Journal title :	Semigroup Forum
Publisher :	Springer
Peer reviewed :	Yes (verified by ORBi^lu)
ISSN :	0037-1912
e-ISSN :	1432-2137
City :	New York
Country :	Germany
Keywords :	[en] 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.
Permalink :	http://hdl.handle.net/10993/34510
DOI :	10.1007/s00233-018-9973-y
Other URL :	https://link.springer.com/article/10.1007/s00233-018-9973-y

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	1. Assoc_Nondecr_Idemp_Reduc.pdf		Publisher postprint	292.62 kB	View/Open

All documents in ORBi^lu are protected by a user license.