For distinct coordinates , replace a member containing but not by its partner with exchanged for , provided that partner is absent. This set family operation preserves cardinality. Repeating shifts with terminates because every change decreases . Its effect on shadows is described by coordinate-shift shadow containment.
In a set family, replace a set containing by its deletion of only when that deletion is absent. This preserves cardinality and cannot increase maximum pairwise Hamming distance. If a new set and a retained set gave a larger distance, the retained set's deletion would already have been present; that deletion and the original uncompressed set would give the same distance. Repeated downward compressions yield a down-set.
For a family in the -dimensional Boolean lattice, the loss of trace cardinality on deleting coordinate equals the number of pairs both in the family. If every direction has at least two such edges, downward coordinate compression preserves that property. The resulting down-set contains the empty set and all singletons. Each coordinate must also occur in a two-element member. Those pairs cover all coordinates and number at least , giving the bound. For , the empty set, all singletons and a minimum collection of pairs covering every coordinate attain it.
For a uniform set family, the lower shadow of its shifted set family is contained in the shifted lower shadow. Check the witness in the four patterns of membership in coordinates . A surviving shadow member containing only must have both old shadow partners; a member containing only needs either old partner. Taking complements exchanges with and gives the same containment for the upper shadow. Thus coordinate shifts of a set family cannot increase either shadow or their disjoint union, the external vertex boundary of a uniform set family.

Articles by others on the same topic (0)

There are currently no matching articles.