Combinatorial characterization of pseudometrics

From MaRDI portal




Abstract: Let X, Y be sets and let Phi, Psi be mappings with the domains X2 and Y2 respectively. We say that Phi is combinatorially similar to Psi if there are bijections fcolonPhi(X2)oPsi(Y2) and gcolonYoX such that Psi(x,y)=f(Phi(g(x),g(y))) for all x, yinY. It is shown that the semigroups of binary relations generated by sets Phi1(a)colonainPhi(X2) and Psi1(b)colonbinPsi(Y2) are isomorphic for combinatorially similar Phi and Psi. The necessary and sufficient conditions under which a given mapping is combinatorially similar to a pseudometric, or strongly rigid pseudometric, or discrete pseudometric are found. The algebraic structure of semigroups generated by d1(r)colonrind(X2) is completely described for nondiscrete, strongly rigid pseudometrics and, also, for discrete pseudometrics dcolonX2omathbbR.









This page was built for publication: Combinatorial characterization of pseudometrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2204104)