相关论文: Schreier Sets in Ramsey Theory

We generalize the notion of relational precompact expansions of Fra\"iss\'e classes via functorial means, inspired by the technique outlined by Laflamme, Nguyen Van Th\'e and Sauer in their paper Partition properties of the dense local…

We give an almost entirely model-theoretic account of both Ramsey classes of finite structures and of generalized indiscernibles as studied in special cases in (for example) [7], [9]. We understand "theories of indiscernibles" to be special…

In this paper we are interested in the existence of small and big Ramsey degrees of classes of finite unary algebras in arbitrary (not necessarily finite) algebraic language $\Omega$. We think of unary algebras as $M$-sets where $M =…

We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language. Our proof is based on the vector (or…

A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…

We present a new, category theoretic point of view on finite Ramsey theory. Our aims are as follows: -- to define the category theoretic notions needed for the development of finite Ramsey Theory, -- to state, in terms of these notions, the…

We build a bridge from density combinatorics to dimension theory of continued fractions. We establish a fractal transference principle that transfers common properties of subsets of $\mathbb N$ with positive upper density to properties of…

The infinite pigeonhole principle for $k$ colors ($\mathsf{RT}_k$) states, for every $k$-partition $A_0 \sqcup \dots \sqcup A_{k-1} = \mathbb{N}$, the existence of an infinite subset~$H \subseteq A_i$ for some~$i < k$. This seemingly…

A set of points $S$ in Euclidean space $\mathbb{R}^d$ is called \textit{Ramsey} if any finite partition of $\mathbb{R}^{\infty}$ yields a monochromatic copy of $S$. While characterization of Ramsey set remains a major open problem in the…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

In the regime of Galton-Watson trees, first order logic statements are roughly equivalent to examining the presence of specific finite subtrees. We consider the space of all trees with Poisson offspring distribution and show that such…

Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…

Kirszbraun's Theorem states that every Lipschitz map $S\to\mathbb R^n$, where $S\subseteq \mathbb R^m$, has an extension to a Lipschitz map $\mathbb R^m \to \mathbb R^n$ with the same Lipschitz constant. Its proof relies on Helly's Theorem:…

We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.

We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $\omega^{\omega^\omega}$. This was conjectured to be the case by…

We consider finitary approximations of the (embedding) Ramsey property. Using a class of homogeneous reducts of random ordered hypergraphs, we prove that these properties form a strict hierarchy. We also show that every class of finite…

For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces are a convenient language for describing structures equipped with a family of equivalence relations. When $\Lambda$ is finite and distributive, there exists a generic…

As suggested by Currie, we apply the probabilistic method to problems regarding pattern avoidance. Using techniques from analytic combinatorics, we calculate asymptotic pattern occurrence statistics and use them in conjunction with the…

In this paper we study some additive properties of subsets of the set $\nats$ of positive integers: A subset $A$ of $\nats$ is called {\it $k$-summable} (where $k\in\ben$) if $A$ contains $\textstyle \big{\sum_{n\in F}x_n | \emp\neq…

We prove an infinite Ramsey theorem for noncommutative graphs realized as unital self-adjoint subspaces of linear operators acting on an infinite dimensional Hilbert space. Specifically, we prove that if V is such a subspace, then provided…