Abstract
We show that finite ordinal sums of finite antichains are Ramsey objects in the category of finite posets and height-preserving embeddings. Our proof yields a primitive recursive algorithm for constructing the finite posets which contain the required homogeneities. We also find, in terms of the classical Ramsey numbers, best possible upper bounds for the heights of the posets in which the homogeneous structures can be found.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abramson, F.G., Harrington, L.O.: Models without indiscernables. J. Symb. Logic 43, 572–600 (1978)
Fouché, W.L.: Chain partitions of ordered sets. Order 13, 255–266 (1996)
Fouché, W.L.: Symmetry and the Ramsey degree of posets. Discrete Math. 167/168, 309–315 (1997)
Fouché, W.L.: Symmetry and the Ramsey degree of finite relational structures. J. Comb. Theory Ser A 85, 135–147 (1999)
Fouché, W.L., Pretorius, L.M., Swanepoel, C.J.: The Ramsey degrees of bipartite graphs: A primitive recursive proof. Discrete Math. 293, 111–119 (2005)
Graham, R.L., Rothschild, B.L.: Ramsey’s theorem for n-parameter sets. Trans. Amer. Math. Soc. 159, 257–292 (1971)
Graham, R.L., Rothschild, B.L., Spencer, J.L.: Ramsey Theory. Wiley, New York (1990)
Hales, A.W., Jewett, R.I.: Regularity and positional games. Trans. Amer. Math. Soc. 106, 222–229 (1963)
Kechris, A.S., Pestov, V., Todorcevic, S.: Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups. GAFA 15, 106–189 (2005)
Nešetřil, J.: Ramsey theory. In: Graham, R.L., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. 2, pp. 1331–1403. North Holland, Amsterdam (1995)
Nešetřil, J., Rödl, V.: Partitions of relational and set systems. J. Comb. Theory Ser A 83, 289–312 (1977)
Nešetřil, J., Rödl, V.: Ramsey classes of set systems. J. Comb. Theory Ser A 34, 183–201 (1983)
Nešetřil, J., Rödl, V.: Combinatorial partitions of finite posets and lattices– Ramsey lattices. Algebra Universalis 19, 106–119 (1984)
Nešetřil, J., Rödl, V.: The partite construction and Ramsey set systems. Discrete Math. 75, 327–334 (1989)
Paoli, M., Trotter, W.T., Walker, J.W.: Graphs and orders in Ramsey theory and in dimension theory. In: Rival, I. (ed.) Graphs and Order, Reidel (1984)
Prömel, H.J., Voigt, B.: Graham-Rothschild parameter sets. In: Nešetřil, J., Rödl, V. (eds.) Mathematics of Ramsey Theory, pp. 113–149. Springer, Berlin (1990)
Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. 30, 264–286 (1930)
Shelah, S.: Primitive recursive bounds for van der Waerden numbers. J. Amer. Math. Soc. 1, 683–697 (1988)
Sommerhalder, R., van Westhenen, S.C.: The Theory of Computability. Addison Wesley, Reading (1988)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fouché, W.L. (2008). Subrecursive Complexity of Identifying the Ramsey Structure of Posets. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)