A finite partially ordered set and its corresponding set of permutations
Matematičeskie zametki, Tome 4 (1968) no. 5, pp. 511-518
Cet article a éte moissonné depuis la source Math-Net.Ru
The paper presents a method for describing a finite partially ordered set by means of permutations. Such an approach is convenient, in particular, in studying variant orderings of the original set.
@article{MZM_1968_4_5_a2,
author = {S. S. Kislitsyn},
title = {A~finite partially ordered set and its corresponding set of permutations},
journal = {Matemati\v{c}eskie zametki},
pages = {511--518},
year = {1968},
volume = {4},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1968_4_5_a2/}
}
S. S. Kislitsyn. A finite partially ordered set and its corresponding set of permutations. Matematičeskie zametki, Tome 4 (1968) no. 5, pp. 511-518. http://geodesic.mathdoc.fr/item/MZM_1968_4_5_a2/