RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
Gérard Lopez, Claire Rauzy
Abstract
Gérard Lopez, Claire Rauzy
Abstract
Abstract We shall prove here that any binary relation on a base E with cardinality n > 6 is reconstructible from its restrictions of cardinality 2, 3, 4 and (n ‐ 1). This proof needs results of part I of this paper where we characterize any pair of relations R, R' which are 2‐, 3‐ and 4‐hypomorphic. As a corollary we obtain that any binary relation is (n ‐ 4)‐reconstructible (when n > 9).
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract We shall prove here that any binary relation on a base E with cardinality n > 6 is reconstructible from its restrictions of cardinality 2, 3, 4 and (n ‐ 1). This proof needs results of part I of this paper where we characterize any pair of relations R, R' which are 2‐, 3‐ and 4‐hypomorphic. As a corollary we obtain that any binary relation is (n ‐ 4)‐reconstructible (when n > 9).
Key concepts: Cardinality (data modeling), Mathematics, Corollary, Binary relation, Binary number, Relation (database), Combinatorics, Base (topology)