A characterization for all interval doubling schemes of the lattice of permutations
1999 ◽
Vol Vol. 3 no. 4
◽
International audience The lattice \textbfS_n of all permutations on a n-element set has been shown to be \emphbounded [CAS], which is a strong constructive property characterized by the fact that \textbfS_n admits what we call an \emph interval doubling scheme. In this paper we characterize all interval doubling schemes of the lattice \textbfS_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.
2001 ◽
Vol Vol. 4 no. 2
◽
2015 ◽
Vol DMTCS Proceedings, 27th...
(Proceedings)
◽
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
2012 ◽
Vol Vol. 14 no. 2
(Graph Theory)
◽
Keyword(s):
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
2018 ◽
Vol 19
(2)
◽
pp. 217-235
Keyword(s):