A characterization Theorem for all Interval Doubling Schemes of the Lattice of Permutations.

Abstract

We have recalled that all interval doubling schemes of a bounded lattice L are in bijection with all different ways to conduct L starting from the two-element lattice by doublings of convex sets.MATHEMATICS