结合幂等非减函数是可约的
Associative idempotent nondecreasing functions are reducible
摘要:
如果一个$n$二元结合函数可以写成二元结合函数的复合,则称之为可约的。我们总结了已知的结果时,函数定义在一个链上,是非递减的。我们的主要结果表明结合幂等函数和非减函数是唯一可约的。
英文摘要:
An $n$-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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。