Discrete Mathematics & Theoretical Computer Science (Dec 1999)

A characterization for all interval doubling schemes of the lattice of permutations

  • Nathalie Caspard

Journal volume & issue
Vol. 3, no. 4

Abstract

Read online

The lattice S n of all permutations on a n-element set has been shown to be bounded [CAS], which is a strong constructive property characterized by the fact that S n admits what we call an interval doubling scheme. In this paper we characterize all interval doubling schemes of the lattice S n, a result that gives a nice precision on the bounded nature of the lattice of permutations. This theorem is a direct corollary of two strong properties that are also given with their proofs.