Big Ramsey Degrees and Infinite Languages

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

  • Samuel Braunfeld - , Charles University Prague (Author)
  • David Chodounský - , Charles University Prague, Czech Academy of Sciences (Author)
  • Jan Hubička - , Charles University Prague (Author)
  • Jamal Kawach - , University of Toronto (Author)
  • Matěj Konečný - , Chair of Algebra and Discrete Structures, Charles University Prague (Author)
  • Noé de Rancourt - , Laboratoire Paul Painlevé - CNRS UMR 8524 (Author)

Abstract

This paper investigates big Ramsey degrees of unrestricted relational structures in (possibly) infinite languages. Despite significant progress in the study of big Ramsey degrees, the big Ramsey degrees of many classes of structures with finite small Ramsey degrees are still not well understood. We show that if there are only finitely many relations of every arity greater than one, then unrestricted relational structures have finite big Ramsey degrees, and give some evidence that this is tight. This is the first time finiteness of big Ramsey degrees has been established for a random structure in an infinite language. Our results represent an important step towards a better understanding of big Ramsey degrees for structures with relations of arity greater than two.

Details

Original languageEnglish
Article number26
Number of pages26
JournalAdvances in Combinatorics
Volume2024 (2024)
Publication statusPublished - 10 Aug 2024
Peer-reviewedYes

Keywords