Kiss, Gergely and Somlai, Gábor (2019) Associative idempotent nondecreasing functions are reducible. SEMIGROUP FORUM, 98 (1). pp. 140-153. ISSN 0037-1912
|
Text
1707.04341v3.pdf Download (187kB) | Preview |
Official URL: https://doi.org/10.1007/s00233-018-9973-y
Abstract
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 summarise 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.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Mar 2019 11:30 |
| Last Modified: | 05 Mar 2019 11:30 |
| URI: | http://real.mtak.hu/id/eprint/91767 |
Actions (login required)
 |
Edit Item |
