Shuffling of Linear Orders
Canadian mathematical bulletin, Tome 38 (1995) no. 2, pp. 223-229

Voir la notice de l'article provenant de la source Cambridge University Press

A linearly ordered set A is said to shuffle into another linearly ordered set B if there is an order preserving surjection A —> B such that the preimage of each member of a cofinite subset of B has an arbitrary pre-defined finite cardinality. We show that every countable linearly ordered set shuffles into itself. This leads to consequences on transformations of subsets of the real numbers by order preserving maps.
DOI : 10.4153/CMB-1995-032-1
Mots-clés : 06A05
Orr, John Lindsay. Shuffling of Linear Orders. Canadian mathematical bulletin, Tome 38 (1995) no. 2, pp. 223-229. doi: 10.4153/CMB-1995-032-1
@article{10_4153_CMB_1995_032_1,
     author = {Orr, John Lindsay},
     title = {Shuffling of {Linear} {Orders}},
     journal = {Canadian mathematical bulletin},
     pages = {223--229},
     year = {1995},
     volume = {38},
     number = {2},
     doi = {10.4153/CMB-1995-032-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1995-032-1/}
}
TY  - JOUR
AU  - Orr, John Lindsay
TI  - Shuffling of Linear Orders
JO  - Canadian mathematical bulletin
PY  - 1995
SP  - 223
EP  - 229
VL  - 38
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1995-032-1/
DO  - 10.4153/CMB-1995-032-1
ID  - 10_4153_CMB_1995_032_1
ER  - 
%0 Journal Article
%A Orr, John Lindsay
%T Shuffling of Linear Orders
%J Canadian mathematical bulletin
%D 1995
%P 223-229
%V 38
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1995-032-1/
%R 10.4153/CMB-1995-032-1
%F 10_4153_CMB_1995_032_1

[1] 1. Hausdorff, F., Grundzùge einer Théorie der Geordneten Mengen, Math. Ann. 65(1908), 435—505. Google Scholar

[2] 2. Landraitis, C., A combinatorial property of the homomorphism relation between countable order types, J. Symbolic Logic 44(1979), 403–411. Google Scholar

[3] 3. Laver, R., On Fraisse s order type conjecture, Ann. of Math. 93( 1971 ), 89–111. Google Scholar

[4] 4. John, C. St. and Nash-Williams, A., On well-quasi-ordering finite trees, Math. Proc. Cambridge Philos. Soc. 61(1965), 833–835. Google Scholar

[5] 5. John, C. St. and Nash-Williams, A., On well-quasi-ordering infinite trees, Math. Proc. Cambridge Philos. Soc. 61(1965), 697—720. Google Scholar

[6] 6. Orr, J. L., Stable ideals of nest algebras, preprint. Google Scholar

[7] 7. Ringrose, J. R., On some algebras of operators, Proc. London Math. Soc. (3) 15(1965), 61—83. Google Scholar

[8] 8. Rosenstein, J. G., Linear orderings, Academic Press, New York, 1982 Google Scholar

Cité par Sources :