Semirigid systems of three equivalence relations

zbMATH Open1398.08001arXiv1505.02955MaRDI QIDQ4963149FDOQ4963149

Authors: Masahiro Miyakawa, Maurice Pouzet, Hisayuki Tatsumi, Christian Delhommé, Ivo G. Rosenberg 

Publication date: 6 November 2018

Abstract: A system $mathcalM$ of equivalence relations on a set $E$ is emph{semirigid} if only the identity and constant functions preserve all members of $mathcalM$. We construct semirigid systems of three equivalence relations. Our construction leads to the examples given by Z'adori in 1983 and to many others and also extends to some infinite cardinalities. As a consequence, we show that on every set of at most continuum cardinality distinct from $2$ and $4$ there exists a semirigid system of three equivalence relations.

Full work available at URL: https://arxiv.org/abs/1505.02955

Recommendations

• Semirigid equivalence relations on a finite set
• scientific article; zbMATH DE number 774085
• Rigid relational systems: A general approach
• scientific article; zbMATH DE number 859903
• A stronger form of the theorem on the existence of a rigid binary relation on any set

zbMATH Keywords

Latin squaresrigidityquasigroupsequivalence relationsclones3-netssemirigidity

Mathematics Subject Classification ID

Relational systems, laws of composition (08A02) Operations and polynomials in algebraic structures, primal algebras (08A40)

Cited In (3)

• Semirigid equivalence relations on a finite set
• Title not available (Why is that?)
• Projective planarity of matroids of 3-nets and biased graphs

This page was built for publication: Semirigid systems of three equivalence relations

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