Associative idempotent nondecreasing functions are reducible
Rings and Algebras
2018-09-05 v3
Abstract
An -ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that associative idempotent and nondecreasing functions are uniquely reducible.
Cite
@article{arxiv.1707.04341,
title = {Associative idempotent nondecreasing functions are reducible},
author = {Gergely Kiss and Gábor Somlai},
journal= {arXiv preprint arXiv:1707.04341},
year = {2018}
}
Comments
12 pages