Trifference

Vgl. zur begrifflichen Ausgangslage Körner, J., Simonyi, G., Trifference, Studia Scientiarum Mathematicarum Hungarica 30, 1995, S. 95–103.

To distinguish n objects, we can label them by n binary sequences of length [log2 n] each. Shorter sequences would not do. How about tristinguishing n objects? In this problem we use ternary sequences for labeling and require that any three of these be different in one and the same coordinate. This is the simplest unsolved case of a problem known as Perfect Hashing. We give a non-existence bound for a similar problem on binary sequences. We also deal with related problems of Edge-Colorings in Graphs. It is shown that the minimum number of tricolorings needed to give every triangle of Kn all the three colors in at least one coloring is at most [log2 n ].

FUCHS, Peter, 2016. Der Fuss des Leuchtturms liegt im Dunkeln: eine ernsthafte Studie zu Sinn und Sinnlosigkeit. Weilerswist: Velbrück Wissenschaft. ISBN 978-3-95832-064-2, p. 193–196 (196N27).

Trifference: Every pair of entities is regularly preset: they are already enacted in the space of signification so that their relatedness in significance is established from a third part: the Configurator. Then, we can say their relatedness is built more from a trifference than from a difference.

LAVANDEROS, Leonardo and MASSEY, Kenneth, 2014. From Manufacture to Mindfacture: A Relational Viable Systems Theory. IGI Global. ISBN 978-1-4666-7369-4. pdf

ISBN 978-1-4666-7372-4 (print & Perpetual Access : alk. paper)