A dual Ramsey theorem for permutations (Q2401425): Difference between revisions

Summary: \textit{M. Sokić} [Order 29, No. 1, 1--30 (2012; Zbl 1254.03066)] proved that the that the class of all finite permutations has the Ramsey property. Using different strategies the same result was then reproved by \textit{J. Böttcher} and \textit{J. Foniok} [Electron. J. Comb. 20, No. 1, Research Paper P2, 10 p. (2013; Zbl 1267.05284)], and by \textit{M. Bodirsky} [ibid. 21, No. 2, Research Paper P2.22, 13 p. (2014; Zbl 1300.05311)] and in 2015 yet another proof was provided by M. Sokić.{ }Using the categorical reinterpretation of the Ramsey property in this paper we prove that the class of all finite permutations has the dual Ramsey property as well. It was \textit{K. Leeb} [The categories of combinatorics. Combinatorial structures and their applications. New York: Gordon and Breach (1970)] who pointed out that the use of category theory can be quite helpful both in the formulation and in the proofs of results pertaining to structural Ramsey theory. In this paper we argue that this is even more the case when dealing with the dual Ramsey property.