Abstract
The class of finite distributive lattices, as many other classes of structures, does not have the Ramsey property. It is quite common, though, that after expanding the structures with appropriately chosen linear orders the resulting class has the Ramsey property. So, one might expect that a similar result holds for the class of all finite distributive lattices. Surprisingly, Kechris and Sokić have proved in 2012 that this is not the case: no expansion of the class of finite distributive lattices by linear orders satisfies the Ramsey property. In this paper we prove that the variety of distributive lattices is not an exception, but an instance of a more general phenomenon. We show that for almost all nontrivial locally finite varieties of lattices no “reasonable” expansion of the finite members of the variety by linear orders gives rise to a Ramsey class. The responsibility for this lies not with the lattices as structures, but with the lack of algebraic morphisms: if we consider lattices as partially ordered sets (and thus switch from algebraic embeddings to embeddings of relational structures) we show that every variety of lattices gives rise to a class of linearly ordered posets having both the Ramsey property and the ordering property. It now comes as no surprise that the same is true for varieties of semilattices.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abramson, F.G., Harrington, L.A.: Models without indiscernibles. J. Symb. Log. 43, 572–600 (1978)
Day, A., Jezek, J.: The amalgamation property for varieties of lattices. Trans. Amer. Math. Soc. 286, 251–256 (1984)
Draganić, N., Masulović, D.: A ramsey theorem for multiposets. (to appear in European Journal of Combinatorics)
Fouché, W.L.: Symmetry and the Ramsey degree of posets. 15th British Combinatorial Conference (Stirling, 1995). Discrete Math. 167/168, pp. 309–315 (1997)
Fraïssé, R.: Sur certains relations qui généralisent l’ordre des nombres rationnels. C. R. Acad. Sci. Paris 237, 540–542 (1953)
Fraïssé, R.: Sur l’extension aux relations de quelques propriétés des ordres. Ann. Sci. É,cole Norm. Sup. 71, 363–388 (1954)
Graham, R.L., Rothschild, B.L.: Ramsey’s theorem for n-parameter sets. Tran. Amer. Math. Soc. 159, 257–292 (1971)
Grätzer, G.: Lattice theory: Foundation. Birkhäuser (2011)
Hodges, W.: Model theory. Cambridge University Press, Cambridge (1993)
Jipsen, P., Rose, H.: Varieties of lattices. Lecture Notes in Mathematics. Springer, Berlin (1992)
Kechris, A.S., Pestov, V.G., Todorcević, S.: Fraïssé limits, Ramsey theory and topological dynamics of automorphism groups. GAFA, Geom. Funct. Anal. 15, 106–189 (2005)
Kechris, A., Sokić, M.: Dynamical properties of the automorphism groups of the random poset and random distributive lattice. Fund. Math. 218, 69–94 (2012)
Masulović, D.: Pre-adjunctions and the Ramsey property. (accepted for publication in European Journal of Combinatorics)
Masulović, D., Scow, L.: Categorical equivalence and the Ramsey property for finite powers of a primal algebra. Algebra Universalis 78, 159–179 (2017)
Nesetril, J.: Ramsey theory. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of combinatorics, vol. 2, pp 1331–1403. MIT Press, Cambridge (1995)
Nesetril, J.: Ramsey classes and homogeneous structures. Comb. Probab. Comput. 14, 171–189 (2005)
Nesetril, J.: Metric spaces are Ramsey. Eur. J. Comb. 28, 457–468 (2007)
Nesetril, J., Rödl, V.: Partitions of subgraphs. In: Fiedler, M. (ed.) Recent advances in graph theory, pp 405–412. Academia, Prague (1975)
Nesetril, J., Rödl, V.: Partitions of finite relational and set systems. J. Combin. Theory Ser.A 22, 289–312 (1977)
Nesetril, J., Rödl, V.: On a probabilistic graph-theoretical method. Proc. Amer. Math. Soc. 72, 417–421 (1978)
Nesetril, J., Rödl, V.: Combinatorial partitions of finite posets and lattices – Ramsey lattices. Algebra Universalis 19, 106–119 (1984)
Paoli, M., Trotter, W.T. Jr, Walker, J.W.: Graphs and orders in Ramsey theory and in dimension theory. In: Graphs and order (Banff, Alta., 1984), 351–394 NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., vol. 147. Reidel, Dordrecht (1985)
Prömel, H.J., Voigt, B.: Recent results in partition (Ramsey) theory for finite lattices. Discr. Math. 35, 185–198 (1981)
Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. 30, 264–286 (1930)
Sokić, M.: Ramsey properties of finite posets. Order 29, 1–30 (2012)
Sokić, M.: Semilattices and the Ramsey property. J. Symb. Log. 80, 1236–1259 (2015)
Acknowledgments
The author gratefully acknowledges the support of the Ministry of Science, Education and Technological Development of the Republic of Serbia, Grant No. 174019.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Mašulović, D. The Ramsey and the Ordering Property for Classes of Lattices and Semilattices. Order 36, 487–500 (2019). https://doi.org/10.1007/s11083-018-9478-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-018-9478-z