Copula-like operations on finite settings

This paper deals with discrete copulas considered as a class of binary aggregation operators on a finite chain. A representation theorem by means of permutation matrices is given. From this characterization, we study the structure of associative discrete copulas and a theorem of decomposition of any discrete copula in terms of associative discrete copulas is obtained. Finally, some aspects concerning their extension to copulas are dealt with.