TY -
T1 - Combinatorial characterization of pseudometrics
SN - /
UR - http://hdl.handle.net/10138/317289
T3 -
A1 - Dovgoshey, O.; Luukkainen, J.
A2 -
PB -
Y1 - 2020
LA - eng
AB - Let X, Y be sets and let similar to, similar to be mappings with the domains X2 and Y 2 respectively. We say that similar to is combinatorially similar to similar to if there are bijections f : similar to(X2) similar to similar to(Y 2) and g : Y similar to X such that similar to (x, y) = f(similar to(g(x), g(y))) for all x, y similar to Y. It is shown that the semigroups of binary relations generated by sets {similar to-1 (a): a similar to similar to(X 2)} and {similar to-1 (b): b similar to sim...
VO -
IS -
SP -
OP -
KW - 111 Mathematics; pseudometric; strongly rigid metric; equivalence relation; semigroup; of binary relations
N1 -
PP -
ER -