OFFSET
1,1
COMMENTS
The number of discrete uninorms on the finite chain L_n={0,1,...,n-1,n}, i.e., the number of monotonic increasing binary functions U: L_n^2->L_n such that U is commutative (U(x,y)=U(y,x) for all x,y in L_n), associative (U(U(x,y),z)=U(x,U(y,z)) for all x,y,z in L_n) and has neutral element e in L_n (U(x,e)=x for all x in L_n).
LINKS
M. Couceiro, J. Devillet and J.L. Marichal. Characterizations of idempotent discrete uninorms, Fuzzy Sets and Systems, Volume 334, 2018, 60-72.
M. Mas, S. Massanet, D. Ruiz-Aguilera, and J. Torrens A survey on the existing classes of uninorms, Journal of Intelligent and Fuzzy Systems, Volume 29, 2015, 1021-1037.
M. Munar, S. Massanet and D. Ruiz-Aguilera, On the cardinality of some families of discrete connectives, Information Sciences, Volume 621, 2023, 708-728.
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Marc Munar, Nov 18 2023
STATUS
approved