Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4653741 | European Journal of Combinatorics | 2014 | 25 Pages |
Abstract
A relation R is (â¤k)-reconstructible (k a positive integer) if it is isomorphic with any relation S on the same vertex set with the property that the relations induced by R and S on any set of at most k vertices are isomorphic; it is (â¤k)-self dual if every restriction to at most k vertices is self dual, i.e.  isomorphic to its dual relation (the relation obtained by reversing its arcs). In particular, relying on the description of (â¤k)-self dual binary relations, we characterize, for each kâ¥4, all (â¤k)-reconstructible binary relations: A binary relation is (â¤k)-reconstructible if and only if its modules that are chains are finite and its (â¤k)-self dual modules are self dual.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Youssef Boudabbous, Christian Delhommé,