A collection of topological Ramsey spaces of trees and their application to profinite graph theory
|
|
- Asher Norton
- 5 years ago
- Views:
Transcription
1 A collection of topological Ramsey spaces of trees and their application to profinite graph theory Yuan Yuan Zheng Abstract We construct a collection of new topological Ramsey spaces of trees. It is based on the Halpern-Läuchli theorem, but different from the Milliken space of strong subtrees. We give an example of its application by proving a partition theorem for profinite graphs. 0 Introduction Milliken s theorem ([8] concerns colourings of all infinite strong subtrees of a fixed tree U, where U is an arbitrary rooted finitely branching tree of height ω without terminal nodes. It shows that the Ramsey property for sets of infinite strong subtrees is captured by the Baire property in the corresponding tree topology. In other words, as Todorcevic [10] formulates it, the set of all infinite strong subtrees of U form a topological Ramsey space, called the Milliken space. The proof of Milliken s theorem is based on the Halpern-Läuchli theorem ([5]. Milliken s theorem generalizes Silver s theorem ([7] and has found various applications to partition properties. For example, Devlin in [2] defined the Devlin embedding types of finite subsets of the complete binary tree, which can be realized by going to a strong subtree, and applied Milliken s theorem to show that the odd tangent numbers characterize the Ramsey properties of the countable dense linear ordering (Q, < Q. Moreover, most of the known perfectset theorems can naturally be proved on the basis of the Milliken space. For example, the following partition theorem for perfect sets was conjectured by Galvin ([3], who proved it for n 3, and proved by Blass. Theorem 0.1 (Blass. [1]. For every perfect subset P of R and every finite continuous colouring of [P ] n there is a perfect set Q P such that [Q] n has at most (n 1! colours. To prove this theorem, Blass defined patterns, or embedding types, for finite subsets of a perfect tree T such that for every finite continuous colouring of finite subsets of the nodes in T, one can make all subsets with a fixed pattern monochromatic by going to a perfect subtree. Todorcevic ([10, Cor. 6.47] provided a simpler proof of Blass s theorem using the Milliken space, as the perfect trees in Blass s argument can be replaced by strong subtrees Mathematics Subject Classification: 03E02, 03E05, 05C05, 05C55. Key words: Ramsey theory, topological Ramsey space, trees, partition, profinite graph theory 1
2 In this paper, we construct a collection of topological Ramsey spaces of trees, one for each type τ of finite graphs. Each space (G (τ,, r consists of G max - trees of a particular shape. Similar to the Milliken space, the new spaces G (τ are also based on the Halpern-Läuchli theorem. We expect the spaces to have similar applications as the Milliken space does. We exemplify this by applying these topological Ramsey spaces to prove the following partition theorem for profinite graphs. Theorem 0.2 (Huber-Geschke-Kojman. For every finite ordered graph A there is k(a < ω such that for every universal modular profinite ordered graph G, and for every finite Baire-measurable colouring of the set of all copies of A in G, there is a closed copy G G of G such that the set of all copies of A in G has at most k(a colours. This theorem was originally proved by Huber, Geschke, and Kojman in [6]. Similar to the way Blass proved Theorem 0.1 by partitioning finite subsets into embedding types in [1], Huber, Geschke, and Kojman proved the above theorem by partitioning the isomorphism class of A into k(a many smaller classes, called strong isomorphism classes, or types. We use the new space G (τ to prove the following Theorem 0.3 from which Theorem 0.2 follows as shown in [6]. Theorem 0.3. [6, Thm. 3.2]. Let T be an arbitrary G max -tree. For every type τ of a finite induced subgraph of G max, and for every continuous colouring c : ( G(T τ 2, there is a Gmax -subtree S of T such that c is constant on ( G(S τ. In the same manner as Todorcevic proved Blass s Theorem 0.1, we design a G -tree envelope for every finite ordered graph, and use the properties of the topological Ramsey space G (τ to prove Theorem 0.3. We define G max -trees and types in Section 1, construct the topological Ramsey spaces in Section 2, and prove the partition theorem for profinite ordered graphs as an application of the spaces in Section 3. I am grateful to Professor Stevo Todorcevic for his guidance. I would also like to thank Osvaldo Guzmán González who pointed out a mistake in an earlier version of this work. This work was partially supported by the Queen Elizabeth II Graduate Scholarship in Science and Technology. 1 Preliminaries 1.1 Trees and graphs By a graph we mean an ordered graph. When we say that two graphs are isomorphic, we tacitly understand that they are order-isomorphic. Similarly, by an embedding we mean an order-embedding. For a set X, we say Y is an n-subset of X if Y is a subset of X of size n. Let [X] n = {Y X : Y = n} be the set of all n-subsets of X. For a graph G, let V (G denote its vertex set and E(G [V (G] 2 denote its edge relation. Definition 1.1. Let ω <ω be the set of all finite sequences of elements in ω. Let denote the initial segment relation. For an element s ω <ω, let s denote the length of s. For n < ω, let ω <n = {s ω <ω : s < n} and ω >n = {s ω <ω : s > n}. 2
3 The definitions of ω n and ω n are similar. By a tree we mean a downward closed subset T of ω <ω, ordered by. Each element t of a tree T is called a node. For a tree T, let [T ] be the set of all infinite branches of T, i.e. [T ] = {x ω ω : ( n < ω x n T }, where we consider x as an infinite sequence of natural numbers, and x n is its initial segment of length n. We say T is a subtree of T if T T and T is a tree. Definition 1.2. For a tree T and t T, let succ T (t be the set of all immediate successors of t in T, i.e. succ T (t = {s T : (t s ( s T (s s s t}. Let T t be the set of all nodes in T comparable to t, i.e. T t = {s T : t s s t}. Now we define the tree T max, which is the base of the construction of the topological Ramsey space G. Let R be the Rado graph, with vertex set ω. For n ω, let R n be the induced subgraph of R on {0,..., n}. Definition 1.3. [6]. Let T max ω <ω be the tree such that t T max succ Tmax (t = {t 0, t 1,..., t t }. For t T max, we define G t to be the ordered graph on the vertex set succ Tmax (t with lexicographical ordering, such that G t is isomorphic to R t. Note that [T max ] ω ω. Suppose x, y [T max ], let x y ω <ω be the common initial segment of x and y, i.e. x y = x min{n : x(n y(n}. Definition 1.4. [6]. The tree T max and the graphs G t (t T induce a graph G max on the vertex set [T max ], ordered lexicographically, with the edge relation defined as follows. For x, y [T max ], {x, y} E(G max if and only if {x ( x y + 1, y ( x y + 1} E(G x y. Lemma 1.5. [6, Lem. 2.1]. If H is a finite graph and t T max then there is s T max with t s such that H embeds into G s. We construct large subtrees of T max, the G max -trees, to get induced subgraphs of G max containing copies of G max. Definition 1.6. [6]. Let T be a (finite or infinite subtree of T max and t T. We define G T t to be the induced subgraph of G t on the vertex set succ T (t. We define G(T to be the induced subgraph of G max on [T ]. We say T is a G max -tree if for every finite graph H and every t T, there is s T with t s such that H embeds into G T s. In particular, T max is a G max -tree. 3
4 For n ω, let [G max ] n denote the set of all induced subgraphs of G max of size n. Since each such subgraph is completely determined by its vertex set, we may identify [G max ] n with the set of all n-subsets of vertices of G max, i.e. [G max ] n = [V (Gmax ] n = [[T max ]] n [ω ω ] n. We equip ω ω with the first-difference metric topology, which has basic open sets of the form [σ] = {x ω ω : σ x} for σ ω <ω. Then we let [ω ω ] n have the induced product topology, and [G max ] n have the subspace topology. 1.2 Types Definition 1.7. Suppose T is a G max -tree and H is a finite induced subgraph of G(T. Let (H = max{ x y : x, y H}, H = {x ( (H + 1 : x H}. We illustrate the idea of this definition with an example. Example. Let H = {x, y, z} [G max ] 3 as in Figure 1, where x = , y = , and z = Then (H = 2 and H = {s, t, u}, where s = 000, t = 002 and u = 011. x y z... s t u Figure 1: (H and H Definition 1.8. [6]. Let T be a G max -tree. Let H and H be finite induced ordered subgraphs of G(T. We say H and H are strongly isomorphic if there exists an isomorphism ϕ : H H such that {x 0, y 0 }, {x 1, y 1 } [H] 2, x 0 y 0 x 1 y 1 ϕ(x 0 ϕ(y 0 ϕ(x 1 ϕ(y 1. Clearly, strong isomorphism is an equivalence relation. By a type we mean a strong isomorphism equivalence class. We have the following observation: Let H be a finite induced subgraph of G(T, with T being a G max -tree. We order its vertex set V (H = {x 0,..., x k 1 } lexicographically. We consider the way in which x i x i+1 (i < k 1 is ordered in the usual ordering of ω. 4
5 If two graphs H, H are order-isomorphic and have the same ordering of their corresponding x i x i+1 (i < k 1, then they are strongly isomorphic. In particular, there are only finitely many types inside an isomorphism class. Definition 1.9. Suppose G, H are graphs and τ is a type. Let ( G H be the set of all induced subgraphs H of G isomorphic to H. Let ( G τ be the set of all induced subgraphs of G of type τ. 2 A topological Ramsey space In this section, we fix a type τ and build a topological Ramsey space. We may denote this space by G (τ to emphasize the type. We write it as G when the type is clear from the context. Let m + 1 be the number of vertices for a graph in τ. Let {F i : i < ω} be the set of all finite (ordered graphs, up to isomorphism, labelled such that for every i < j < ω, either V (F i < V (F j or V (F i = V (F j and E(F i E(F j. Let T be a tree. We say a node t T is a branching node if succ T (t > 1. We say T is skew if T has at most one branching node at each level, i.e. n ω {t T ω n : succ T (t > 1} 1. Recall that for a (finite or infinite tree T and a node t T, T t = {s T : t s s t}. Definition 2.1. We define the space (G,, r as follows. Let A G if A is a skew subtree of T max and when we enumerate the set of branching nodes {s A : succ A (s > 1} as {s i } i<ω in the order of length, (1 there is a graph H τ with (2 for all i > 0, H = A ω sm +1 ; (i s A ω > sm u succ A (s G A s = F i!t A ( u t G A t = F i+1 ; (ii for every pair t, s A ω > sm, G A t = F i G A s = F i+1 t < s ; (iii if {t A : G A t = F i } is enumerated in the order of length t, as {t j } j, then there is k < ω such that {t j k} j is strictly increasing in lexicographical ordering. When we say that {s i } i<ω is the set of branching nodes in A, we tacitly assume that the length s i is strictly increasing in i. For A, B G, let A B if A B. 5
6 For k < ω and A G with the set of branching nodes {s i } i<ω, we define the finite approximation r k (A inductively on k. Let r 0 (A =. Let r k+1 (A = A ω sk +1. Intuitively, (1 requires A to have a base of the same shape as H, for some H τ. Condition (2 indicates that we can divide the rows above the base of A into interval sections such that in the ith section we see that each node at the bottom of the section extends and branches into precisely one fan whose induced subgraph is isomorphic to F i. Moreover, the branching nodes are taller and taller when we look from left to right. An example of an element A G and some of its finite approximations are shown in Figures 2 to 5.. s 8 s 7.. s 5 s 6 G A s i = F2 s 4 s 3 G A s i = F1 s 2 s 1 base s 0 Figure 2: Example of A G s 0 Figure 3: r 1 (A s 1 s 0 Figure 4: r 2 (A s 2 s 3 s 1 s 0 Figure 5: r 4 (A Before checking that (G,, r is a topological Ramsey space, we specify a few more definitions that are often used in topological Ramsey spaces. Let G < denote the set of all finite approximations, i.e. G < = {r k (A : A G k ω}. 6
7 For a, b G <, let a fin b if a b. Let a = n if there is A G with r n (A = a. For a, b G <, we write a b if there are k < l < ω and A G such that a = r k (A and b = r l (A. Note that the same symbols and are used in two different situations: among elements in ω ω, and among elements in G <. For a G < and A G, depth A (a = min{n : a fin r n (A}, where by convention min =. We equip the space G with the Ellentuck topology, with basic open sets of the form [a, A] = {X G : (X A ( k(r k (X = a}, for a G < and A G. For k < ω, let G k = {r k (X : X G } [k, A] = [r k (A, A], and r k [a, A] = {r k (X : X [a, A]}. The height height(a of an element a G < is n if s = n for all s a. In general, height(a a. Now we show that (G,, r is a topological Ramsey spaces by proving that G is closed and it satisfies the axioms (A1-(A4 as defined in [10]. It is straightforward to check (A1-(A3 and that G is a closed subset of (G < ω when we identify A G with (r n (A n<ω (G < ω and equip G < with the discrete topology and (G < ω the product topology. We prove (A4 in Lemma 2.5 below. We will be using the Nešetřil-Rödl Theorem 2.2 and the Halpern-Läuchli Theorem 2.4. Theorem 2.2 (Nešetřil-Rödl. For every finite ordered graphs A and B there is a finite ordered graph C such that for every 2-colouring of ( C A there is B ( C B such that ( B A is monochromatic. In this case, we write C (B A. In fact, we only need the 1-dimension version of the Halpern-Läuchli theorem below. Definition 2.3. Let T be a (downwards closed tree and N an infinite subset of ω. We say a set S is a strong subtree of n N T ωn if there is an infinite set M N such that 1. S m M T ωm and S ω m for all m M; 2. if m 1 < m 2 are two successive elements of M and if s S ω m1, then every immediate successor of s in n N T ωn (ordered by has exactly one extension in S ω m2. Note that a strong subtree is not necessarily a tree according to our Definition 1.1 since it may not be downward closed. Theorem 2.4 (Halpern-Läuchli. For a tree T and N [ω] ω, for every finite colouring of n N T ωn there is a strong subtree S of n N T ωn with M [N] ω such that m M S ωm is monochromatic. 7
8 We observe that every A G is a G max -tree and every G max -tree contains some A G as a subtree. This is because for all n < ω, we can find infinitely many m ω such that F n embeds into F m. We define (J n n<ω to be a sequence of finite graphs such that for each n < ω the graphs F 0,..., F n embed into J n. Lemma 2.5. The axiom (A4 holds for (G,, r, i.e. B G, if depth B (a < and O G a +1, then for a G < and A [depth B (a, B] r a +1 [a, A] O or r a +1 [a, A] O =. Proof. Let a, B, O be as in the statement. Let h 0 = height(a. Note that a has a many branching nodes, and each element in G a +1 has a + 1 many. In particular, we can find u a ω h0 and i 0 < ω such that for every b G a +1 with a b there is a unique branching node t b u, and G b t =. We define a subset B { ( G B } t : t Bu induced by O as follows. For t B u and H ( G B t, let b be the downward closure of a V (H. Put H in B if and only if b O. Let B c denote { ( G B } t : t Bu \ B. We aim to shrink the tree B u to a G max -tree A such that { ( G A t : t A B or B c. Then it is clear that for each v a ω h0 \ {u} we can shrink B v to a tree A v such that A A v G. Thus, letting A = A A v we have A [a, B] and r a +1 [a, A] O or r a +1 [a, A] O = as required. We first shrink B u to X, and then X to A. We construct X with a strictly increasing sequence (m k k<ω, where m 0 = 0, such that k < ω s X ω m k, (a X s has a unique branching node t of length in [m k, m k+1 ; (b moreover, for the t from condition (a, G X t ( (c t X G X t s B or B c. = J i0+k; We recursively construct sets X(m k ω m k, then X will be the downward closure of k<ω X(m k and X ω m k = X(m k. Start with m 0 = 0 and X(m 0 = { }. Suppose we have constructed X(m k = {s j : j < l}. By Theorem 2.2, there is a finite graph H such that H (J i0+k Fi 0. For s j X(m k, since B is a G max -tree, s j has an extension t j B such that H embeds into G B t j. By the choice of H, we can find K j ( G B t j J such that i0 +k ( Kj B or B c. Let m k+1 = max{ t j : j < l} + 1. Let X(m k+1 B ω m k+1 such that every node in j<l V (K j has a unique extension in X(m k+1. This finishes the construction of X and (m k k<ω. Now we define a colouring c : k<ω X ωm k 2. For s X ω m k, let c(s = 1 if and only if the unique branching node t X s of length in [m k, m k+1 from (a satisfies ( G X t B. By Theorem 2.4, there is a strong subtree Y of k<ω X ωm k and a strictly increasing sequence (n j j<ω (m k k<ω such that c j<ω Y ωnj ɛ for some ɛ 2. Let A be the downward closure of Y. } 8
9 Claim If k < ω, s Y ω m k and t corresponds to s as in (a, (b, then t A and G A t = G X t. Proof of Claim. As Y ω mk, there is l < ω such that n l = m k. Since Y is a strong subtree of k <ω X ωm k, every immediate successor of s in k <ω X ωm k (that is, the elements in X ω m k+1 extending s has exactly one extension in Y ω n l+1. From the construction of X we know that every node in succ X (t has exactly one extension in X ω m k+1. But the successors of s in k <ω X ωk are precisely the extensions in X ω m k+1 of nodes in succ X (t. Hence the downward closure A of Y must contain t as an element and satisfy G A t = G X t. Then it is straightforward to check that A is a G max -tree. We check that ( G A t A t B or B c. Suppose t A is a branching node. Since A X, t must also be a branching node in X. We can find k such that t [m k, m k+1. Then, by the construction of A, as Y is a strong subtree of X, there is l such that m k = n l, so Y ω n l X ω m k. Let s Y ω n l be an initial segment of t. As c j<ω Y ωnj ɛ, c(s = ɛ. Therefore ( G A t B or B c, depending on the value of ɛ. This holds for all branching nodes t A, so ( G A t A t B or B c as required. This finishes the proof of the lemma. Theorem 2.6. The space (G,, r is a topological Ramsey space. The corollary below follows from the abstract Ellentuck theorem [10, Thm. 5.4]. Corollary 2.7. For every finite Souslin-measurable colouring of G and every A G there is B A such that [, B] is monochromatic. 3 An application to profinite graph theory In this section we present an application of the topological Ramsey spaces (G (τ,, r to profinite graph theory. We define a G -envelope for each finite induced subgraph H. We then prove Theorem 0.3. A modular profinite ordered graph is the inverse limit of an inverse system of finite ordered graphs with modular bonding maps. (See [4] for details. A modular profinite ordered graph is universal if every modular profinite ordered graph order-embeds continuously into it. Geschke proved the existence of a universal modular profinite ordered graph in [4]. Below is a definition of universal profinite ordered graphs from [6] without mentioning an inverse system. Definition 3.1. [6]. A universal profinite ordered graph is a triple G = V, E, <, such that the following conditions hold. 1. V is a compact subset of R \ Q without isolated points, E [V ] 2, and < is the restriction of the standard order on R to V. 2. For every pair of distinct vertices u, v V there is a partition of V to finitely many closed intervals such that (a u, v belong to different intervals from the partition; 9
10 (b for every interval I in the partition, for all v V \ I and for all x, y I, {v, x} E if and only if {v, y} E. 3. Every nonempty open interval of V contains induced copies of all finite ordered graphs. It is clear from this definition that G(T is a universal profinite ordered graph for every G max -tree T. It thus follows from the universality that in order to prove Theorem 0.2, it is sufficient to consider colourings of finite induced subgraphs of G(T, where T is an arbitrary G max -tree. As the number k(a of types in the isomorphism class of a finite ordered graph A is finite, the problem reduces to finding a monochromatic set for colourings of finite induced subgraphs of a fixed type. So it is sufficient to prove Theorem 0.3, which extends readily to Bairemeasurable colourings using standard methods from descriptive set theory. See [6] for a detailed description of how Theorem 0.2 reduces to Theorem 0.3. Definition 3.2. Let τ be a type and H τ. The G -envelope of H is C H = {A G (τ : ( k(r k (A = H }. Lemma 3.3. Let τ be a type and T G (τ. The map { ( } G(T c 1 : [, T ] H : H τ A H if A C H is well-defined and continuous, where we equip the range with discrete topology. Proof. First we check that c 1 is well-defined. Let m < ω be such that, for every H τ, H has m + 1 branching nodes. Then A G k (r k (A = H k = m + 1. Thus, if H, K τ and A C H C K then H = r m+1 (A = K. So c 1 is well-defined. Next, we check that c 1 is continuous. Suppose H τ and A (c 1 1 (H, i.e. A C H. Then the set [m + 1, A] is an open neighbourhood of A included in the c 1 -preimage of H. Hence c 1 is continuous. Finally we prove Theorem 0.3. We will use the following lemma. Lemma 3.4. [6, Lem. 3.3] Let T G and τ be a type. For every continuous colouring c : ( G max τ 2 there exists S T such that c depends only on H, i.e. for H, K ( G(S τ, if H = K then c(h = c(k. Theorem 0.3. [6, Thm. 3.2]. Let T be an arbitrary G max -tree. For every type τ of a finite induced subgraph of G max, and for every continuous colouring c : ( G(T τ 2, there is a Gmax -subtree S of T such that c is constant on ( G(S τ. Proof. Let c and T be given as in the theorem. By Lemma 3.4, we may shrink T and assume that the colouring c depends only on H. We further shrink T and assume T G. We may think of c as a function { ( } G(T c : H : H 2. τ 10
11 Define c : [, T ] 2 by letting c = c c 1. By Lemma 3.4, c is also a continuous function. In particular, c is Souslin-measurable. Now applying Corollary 2.7 gives S T and i 2 such that c [, S] i. Let us check that S satisfies the theorem. Suppose H ( G(S τ. Then its vertex set V (H [S], so H S. Hence there is A [, S] such that A C H. So c(h = c (A = i. Therefore c ( G(S τ i as required. References [1] A. Blass. A partition theorem for perfect sets. Proc. Amer. Math. Soc. 82 (1981, no. 2, [2] D. Devlin. Some partition theorems and ultrafilters on ω. Ph.D. Thesis, Dartmouth College, [3] F. Galvin. Partition theorems for the real line. Notices Amer. Math. Soc. 15 (1968, 660. [4] S. Geschke. Clopen graphs. Fundamenta Mathematicae 220, No. 2 (2013, [5] J. Halpern and H. Läuchli. A partition theorem. Trans. Amer. Math. Soc. 124 (1966, [6] Stefanie Huber, Stefan Geschke, and Menachem Kojman. An induced Ramsey theorem for modular profinite graphs. uni-hamburg.de/home/geschke/papers/gmaxsubjuly28.pdf [7] Silver, Jack. Every analytic set is Ramsey. J. Symbolic Logic 35 (1970, [8] K. R. Milliken. A partition theorem for the infinite subtrees of a tree. Trans. Amer. Math. Soc. 263 (1981, no. 1, [9] J. Nešetřil, V. Rödl. A structural generalization of the Ramsey theorem. Bull. Amer. Math. Soc. 83 (1977, no. 1, [10] S. Todorcevic. Introduction to Ramsey spaces, volume 174 of Annals of Mathematics Studies. Princeton University Press, Princeton, NJ,
Selective Ultrafilters on FIN
Selective Ultrafilters on FIN Yuan Yuan Zheng Abstract We consider selective ultrafilters on the collection FIN of all finite nonempty subsets of N. If countablesupport side-by-side Sacks forcing is applied,
More informationSelective ultrafilters in N [ ], FIN [ ], and R α
Selective ultrafilters in N [ ], FIN [ ], and R α Yuan Yuan Zheng University of Toronto yyz22@math.utoronto.ca October 9, 2016 Yuan Yuan Zheng (University of Toronto) Selective ultrafilters October 9,
More informationRamsey theory of homogeneous structures
Ramsey theory of homogeneous structures Natasha Dobrinen University of Denver Notre Dame Logic Seminar September 4, 2018 Dobrinen big Ramsey degrees University of Denver 1 / 79 Ramsey s Theorem for Pairs
More informationRamsey theory, trees, and ultrafilters
Ramsey theory, trees, and ultrafilters Natasha Dobrinen University of Denver Lyon, 2017 Dobrinen Ramsey, trees, ultrafilters University of Denver 1 / 50 We present two areas of research. Part I The first
More informationThe universal triangle-free graph has finite big Ramsey degrees
The universal triangle-free graph has finite big Ramsey degrees Natasha Dobrinen University of Denver AMS-ASL Special Session on Set Theory, Logic and Ramsey Theory, JMM 2018 Dobrinen big Ramsey degrees
More informationA product of γ-sets which is not Menger.
A product of γ-sets which is not Menger. A. Miller Dec 2009 Theorem. Assume CH. Then there exists γ-sets A 0, A 1 2 ω such that A 0 A 1 is not Menger. We use perfect sets determined by Silver forcing (see
More informationA CLASSIFICATION OF SEPARABLE ROSENTHAL COMPACTA AND ITS APPLICATIONS
A CLASSIFICATION OF SEPARABLE ROSENTHAL COMPACTA AND ITS APPLICATIONS SPIROS ARGYROS, PANDELIS DODOS AND VASSILIS KANELLOPOULOS Contents 1. Introduction 1 2. Ramsey properties of perfect sets and of subtrees
More informationTutorial 1.3: Combinatorial Set Theory. Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011
Tutorial 1.3: Combinatorial Set Theory Jean A. Larson (University of Florida) ESSLLI in Ljubljana, Slovenia, August 4, 2011 I. Generalizing Ramsey s Theorem Our proof of Ramsey s Theorem for pairs was
More informationTHE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES
THE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE RAMSEY DEGREES NATASHA DOBRINEN Abstract. The universal homogeneous triangle-free graph H 3 has finite big Ramsey degrees : For each finite triangle-free
More informationA new proof of the 2-dimensional Halpern Läuchli Theorem
A new proof of the 2-dimensional Halpern Läuchli Theorem Andy Zucker January 2017 Abstract We provide an ultrafilter proof of the 2-dimensional Halpern Läuchli Theorem in the following sense. If T 0 and
More informationHigher dimensional Ellentuck spaces
Higher dimensional Ellentuck spaces Natasha Dobrinen University of Denver Forcing and Its Applications Retrospective Workshop Fields Institute, April 1, 2015 Dobrinen Higher dimensional Ellentuck spaces
More informationParametrizing topological Ramsey spaces. Yuan Yuan Zheng
Parametrizing topological Ramsey spaces by Yuan Yuan Zheng A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Department of Mathematics University of Toronto
More informationA NEW CLASS OF RAMSEY-CLASSIFICATION THEOREMS AND THEIR APPLICATION IN THE TUKEY THEORY OF ULTRAFILTERS, PART 1
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9947(XX)0000-0 A NEW CLASS OF RAMSEY-CLASSIFICATION THEOREMS AND THEIR APPLICATION IN THE TUKEY THEORY OF ULTRAFILTERS,
More informationGENERALIZED ELLENTUCK SPACES AND INITIAL CHAINS IN THE TUKEY STRUCTURE OF NON-P-POINTS
GENERALIZED ELLENTUCK SPACES AND INITIAL CHAINS IN THE TUKEY STRUCTURE OF NON-P-POINTS NATASHA DOBRINEN Abstract. In [1], it was shown that the generic ultrafilter G 2 forced by P(ω ω)/(fin Fin) is neither
More informationTHE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE BIG RAMSEY DEGREES
THE UNIVERSAL HOMOGENEOUS TRIANGLE-FREE GRAPH HAS FINITE BIG RAMSEY DEGREES N. DOBRINEN Abstract. This paper proves that the universal homogeneous triangle-free graph H 3 has finite big Ramsey degrees:
More informationSMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS
SMALL SUBSETS OF THE REALS AND TREE FORCING NOTIONS MARCIN KYSIAK AND TOMASZ WEISS Abstract. We discuss the question which properties of smallness in the sense of measure and category (e.g. being a universally
More informationBANACH SPACES FROM BARRIERS IN HIGH DIMENSIONAL ELLENTUCK SPACES
BANACH SPACES FROM BARRIERS IN HIGH DIMENSIONAL ELLENTUCK SPACES A ARIAS, N DOBRINEN, G GIRÓN-GARNICA, AND J G MIJARES Abstract A new hierarchy of Banach spaces T k (d, θ), k any positive integer, is constructed
More informationUniquely Universal Sets
Uniquely Universal Sets 1 Uniquely Universal Sets Abstract 1 Arnold W. Miller We say that X Y satisfies the Uniquely Universal property (UU) iff there exists an open set U X Y such that for every open
More informationAdam Kwela. Instytut Matematyczny PAN SELECTIVE PROPERTIES OF IDEALS ON COUNTABLE SETS. Praca semestralna nr 3 (semestr letni 2011/12)
Adam Kwela Instytut Matematyczny PAN SELECTIVE PROPERTIES OF IDEALS ON COUNTABLE SETS Praca semestralna nr 3 (semestr letni 2011/12) Opiekun pracy: Piotr Zakrzewski 1. Introduction We study property (S),
More informationA NEW LINDELOF SPACE WITH POINTS G δ
A NEW LINDELOF SPACE WITH POINTS G δ ALAN DOW Abstract. We prove that implies there is a zero-dimensional Hausdorff Lindelöf space of cardinality 2 ℵ1 which has points G δ. In addition, this space has
More informationALMOST DISJOINT AND INDEPENDENT FAMILIES. 1. introduction. is infinite. Fichtenholz and Kantorovich showed that there is an independent family
ALMOST DISJOINT AND INDEPENDENT FAMILIES STEFAN GESCHKE Abstract. I collect a number of proofs of the existence of large almost disjoint and independent families on the natural numbers. This is mostly
More informationBanach Spaces from Barriers in High Dimensional Ellentuck Spaces
Banach Spaces from Barriers in High Dimensional Ellentuck Spaces A. ARIAS N. DOBRINEN G. GIRÓN-GARNICA J. G. MIJARES Two new hierarchies of Banach spaces T k (d, θ) and T(A k d, θ), k any positive integer,
More informationComplexity of Ramsey null sets
Available online at www.sciencedirect.com Advances in Mathematics 230 (2012) 1184 1195 www.elsevier.com/locate/aim Complexity of Ramsey null sets Marcin Sabok Instytut Matematyczny Uniwersytetu Wrocławskiego,
More informationA disjoint union theorem for trees
University of Warwick Mathematics Institute Fields Institute, 05 Finite disjoint union Theorem Theorem (Folkman) For every pair of positive integers m and r there is integer n 0 such that for every r-coloring
More informationA BOREL SOLUTION TO THE HORN-TARSKI PROBLEM. MSC 2000: 03E05, 03E20, 06A10 Keywords: Chain Conditions, Boolean Algebras.
A BOREL SOLUTION TO THE HORN-TARSKI PROBLEM STEVO TODORCEVIC Abstract. We describe a Borel poset satisfying the σ-finite chain condition but failing to satisfy the σ-bounded chain condition. MSC 2000:
More informationTOPOLOGICAL RAMSEY SPACES DENSE IN FORCINGS
TOPOLOGICAL RAMSEY SPACES DENSE IN FORCINGS NATASHA DOBRINEN Abstract. Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological
More informationarxiv: v1 [math.lo] 12 Apr 2017
FORCING IN RAMSEY THEORY NATASHA DOBRINEN arxiv:1704.03898v1 [math.lo] 12 Apr 2017 Abstract. Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and
More informationFinite Induced Graph Ramsey Theory: On Partitions of Subgraphs
inite Induced Graph Ramsey Theory: On Partitions of Subgraphs David S. Gunderson and Vojtěch Rödl Emory University, Atlanta GA 30322. Norbert W. Sauer University of Calgary, Calgary, Alberta, Canada T2N
More informationSELECTED ORDERED SPACE PROBLEMS
SELECTED ORDERED SPACE PROBLEMS HAROLD BENNETT AND DAVID LUTZER 1. Introduction A generalized ordered space (a GO-space) is a triple (X, τ,
More informationHINDMAN S THEOREM AND IDEMPOTENT TYPES. 1. Introduction
HINDMAN S THEOREM AND IDEMPOTENT TYPES URI ANDREWS AND ISAAC GOLDBRING Abstract. Motivated by a question of Di Nasso, we show that Hindman s Theorem is equivalent to the existence of idempotent types in
More informationMORE ABOUT SPACES WITH A SMALL DIAGONAL
MORE ABOUT SPACES WITH A SMALL DIAGONAL ALAN DOW AND OLEG PAVLOV Abstract. Hušek defines a space X to have a small diagonal if each uncountable subset of X 2 disjoint from the diagonal, has an uncountable
More informationTOPOLOGICAL RAMSEY SPACES AND METRICALLY BAIRE SETS
TOPOLOGICAL RAMSEY SPACES AND METRICALLY BAIRE SETS NATASHA DOBRINEN AND JOSÉ G. MIJARES Abstract. We characterize a class of topological Ramsey spaces such that each element R of the class induces a collection
More informationCREATURE FORCING AND TOPOLOGICAL RAMSEY SPACES. Celebrating Alan Dow and his tours de force in set theory and topology
CREATURE FORCING AND TOPOLOGICAL RAMSEY SPACES NATASHA DOBRINEN Celebrating Alan Dow and his tours de force in set theory and topology Abstract. This article introduces a line of investigation into connections
More informationDefinable Graphs and Dominating Reals
May 13, 2016 Graphs A graph on X is a symmetric, irreflexive G X 2. A graph G on a Polish space X is Borel if it is a Borel subset of X 2 \ {(x, x) : x X }. A X is an anticlique (G-free, independent) if
More informationUncountable γ-sets under axiom CPA game
F U N D A M E N T A MATHEMATICAE 176 (2003) Uncountable γ-sets under axiom CPA game by Krzysztof Ciesielski (Morgantown, WV), Andrés Millán (Morgantown, WV) and Janusz Pawlikowski (Wrocław) Abstract. We
More informationCanonicity and representable relation algebras
Canonicity and representable relation algebras Ian Hodkinson Joint work with: Rob Goldblatt Robin Hirsch Yde Venema What am I going to do? In the 1960s, Monk proved that the variety RRA of representable
More informationBorel cardinals and Ramsey ultrafilters (draft of Sections 1-3)
Borel cardinals and Ramsey ultrafilters (draft of Sections 1-3) Richard Ketchersid Paul Larson Jindřich Zapletal May 17, 2012 Abstract This is a draft of the first three sections of a paper in preparation
More informationCOMPACT SPACES WITH HEREDITARILY NORMAL SQUARES
COMPACT SPACES WITH HEREDITARILY NORMAL SQUARES JUSTIN TATCH MOORE 1. Introduction In 1948, Katětov proved the following metrization theorem. Theorem 1.1. [3] If X is a compact space 1 and every subspace
More informationIDEAL GAMES AND RAMSEY SETS
IDEAL GAMES AND RAMSEY SETS CARLOS DI PRISCO, JOSÉ G. MIJARES, AND CARLOS UZCÁTEGUI Abstract. It is shown that Matet s characterization ([9]) of the Ramsey property relative to a selective co-ideal H,
More informationTopological Algebraic Structure on Souslin and Aronszajn Lines
Topological Algebraic Structure on Souslin and Aronszajn Lines Gary Gruenhage (1), Thomas Poerio (2) and Robert W. Heath(2) (1) Department of Mathematics, Auburn University, Auburn, AL 36849 (2) Department
More informationOn a Question of Maarten Maurice
On a Question of Maarten Maurice Harold Bennett, Texas Tech University, Lubbock, TX 79409 David Lutzer, College of William and Mary, Williamsburg, VA 23187-8795 May 19, 2005 Abstract In this note we give
More informationSTEVO TODORCEVIC AND JUSTIN TATCH MOORE
June 27, 2006 THE METRIZATION PROBLEM FOR FRÉCHET GROUPS STEVO TODORCEVIC AND JUSTIN TATCH MOORE 1. Introduction Let us begin this paper by recalling the following classical metrization theorem of Birkhoff
More informationI-Indexed Indiscernible Sets and Trees
1 / 20 I-Indexed Indiscernible Sets and Trees Lynn Scow Vassar College Harvard/MIT Logic Seminar December 3, 2013 2 / 20 Outline 1 background 2 the modeling property 3 a dictionary theorem 3 / 20 order
More informationAn introduction to OCA
An introduction to OCA Gemma Carotenuto January 29, 2013 Introduction These notes are extracted from the lectures on forcing axioms and applications held by professor Matteo Viale at the University of
More informationTopological groups with dense compactly generated subgroups
Applied General Topology c Universidad Politécnica de Valencia Volume 3, No. 1, 2002 pp. 85 89 Topological groups with dense compactly generated subgroups Hiroshi Fujita and Dmitri Shakhmatov Abstract.
More informationRELATIVE TO ANY NONRECURSIVE SET
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 7, July 1998, Pages 2117 2122 S 0002-9939(98)04307-X RELATIVE TO ANY NONRECURSIVE SET THEODORE A. SLAMAN (Communicated by Andreas R.
More informationReverse mathematics of some topics from algorithmic graph theory
F U N D A M E N T A MATHEMATICAE 157 (1998) Reverse mathematics of some topics from algorithmic graph theory by Peter G. C l o t e (Chestnut Hill, Mass.) and Jeffry L. H i r s t (Boone, N.C.) Abstract.
More informationCombinatorial proofs of Gowers FIN k and FIN ± k
Combinatorial proofs of Gowers FIN and FIN ± theorem arxiv:1402.6264v3 [math.co] 18 Oct 2018 Ryszard Franiewicz Sławomir Szczepania Abstract A combinatorial proof of a pigeonhole principle of Gowers is
More informationA G δ IDEAL OF COMPACT SETS STRICTLY ABOVE THE NOWHERE DENSE IDEAL IN THE TUKEY ORDER
A G δ IDEAL OF COMPACT SETS STRICTLY ABOVE THE NOWHERE DENSE IDEAL IN THE TUKEY ORDER JUSTIN TATCH MOORE AND S LAWOMIR SOLECKI Abstract. We prove that there is a G δ σ-ideal of compact sets which is strictly
More informationUltrafilters with property (s)
Ultrafilters with property (s) Arnold W. Miller 1 Abstract A set X 2 ω has property (s) (Marczewski (Szpilrajn)) iff for every perfect set P 2 ω there exists a perfect set Q P such that Q X or Q X =. Suppose
More informationTopological Ramsey spaces from Fraïssé classes, Ramsey-classification theorems, and initial structures in the Tukey types of p-points
Arch. Math. Logic (2017 56:733 782 DOI 10.1007/s00153-017-0540-0 Mathematical Logic Topological Ramsey spaces from Fraïssé classes, Ramsey-classification theorems, and initial structures in the Tukey types
More informationGap Embedding for Well-Quasi-Orderings 1
WoLLIC 2003 Preliminary Version Gap Embedding for Well-Quasi-Orderings 1 Nachum Dershowitz 2 and Iddo Tzameret 3 School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel Abstract Given a
More informationKruskal s theorem and Nash-Williams theory
Kruskal s theorem and Nash-Williams theory Ian Hodkinson, after Wilfrid Hodges Version 3.6, 7 February 2003 This is based on notes I took at Wilfrid s seminar for Ph.D. students at Queen Mary College,
More informationCCC Forcing and Splitting Reals
CCC Forcing and Splitting Reals Boban Velickovic Equipe de Logique, Université de Paris 7 2 Place Jussieu, 75251 Paris, France Abstract Prikry asked if it is relatively consistent with the usual axioms
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationSELF-DUAL UNIFORM MATROIDS ON INFINITE SETS
SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS NATHAN BOWLER AND STEFAN GESCHKE Abstract. We extend the notion of a uniform matroid to the infinitary case and construct, using weak fragments of Martin s Axiom,
More informationOn the Length of Borel Hierarchies
University of Wisconsin, Madison July 2016 The Borel hierachy is described as follows: open = Σ 0 1 = G closed = Π 0 1 = F Π 0 2 = G δ = countable intersections of open sets Σ 0 2 = F σ = countable unions
More informationOn the Effectiveness of Symmetry Breaking
On the Effectiveness of Symmetry Breaking Russell Miller 1, Reed Solomon 2, and Rebecca M Steiner 3 1 Queens College and the Graduate Center of the City University of New York Flushing NY 11367 2 University
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationColoring Problems and Reverse Mathematics. Jeff Hirst Appalachian State University October 16, 2008
Coloring Problems and Reverse Mathematics Jeff Hirst Appalachian State University October 16, 2008 These slides are available at: www.mathsci.appstate.edu/~jlh Pigeonhole principles RT 1 : If f : N k then
More informationON A QUESTION OF SIERPIŃSKI
ON A QUESTION OF SIERPIŃSKI THEODORE A. SLAMAN Abstract. There is a set of reals U such that for every analytic set A there is a continuous function f which maps U bijectively to A. 1. Introduction A set
More informationPCF THEORY AND CARDINAL INVARIANTS OF THE REALS
PCF THEORY AND CARDINAL INVARIANTS OF THE REALS LAJOS SOUKUP Abstract. The additivity spectrum ADD(I) of an ideal I P(I) is the set of all regular cardinals κ such that there is an increasing chain {A
More informationUNCONDITIONAL FAMILIES IN BANACH SPACES. 1. Introduction
UNCONDITIONAL FAMILIES IN BANACH SPACES SPIROS ARGYROS, PANDELIS DODOS AND VASSILIS KANELLOPOULOS Abstract. It is shown that for every separable Banach space X with nonseparable dual, the space X contains
More informationω-stable Theories: Introduction
ω-stable Theories: Introduction 1 ω - Stable/Totally Transcendental Theories Throughout let T be a complete theory in a countable language L having infinite models. For an L-structure M and A M let Sn
More informationA Ramsey theorem for polyadic spaces
F U N D A M E N T A MATHEMATICAE 150 (1996) A Ramsey theorem for polyadic spaces by M. B e l l (Winnipeg, Manitoba) Abstract. A polyadic space is a Hausdorff continuous image of some power of the onepoint
More informationIrredundant Generators
rredundant Generators Jonathan Cancino, Osvaldo Guzmán, Arnold W. Miller May 21, 2014 Abstract We say that is an irredundant family if no element of is a subset mod finite of a union of finitely many other
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATH OPTION, Spring 018 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 0 points.
More informationChain Conditions of Horn and Tarski
Chain Conditions of Horn and Tarski Stevo Todorcevic Berkeley, April 2, 2014 Outline 1. Global Chain Conditions 2. The Countable Chain Condition 3. Chain Conditions of Knaster, Shanin and Szpilrajn 4.
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationEMBEDDING DISTRIBUTIVE LATTICES IN THE Σ 0 2 ENUMERATION DEGREES
EMBEDDING DISTRIBUTIVE LATTICES IN THE Σ 0 2 ENUMERATION DEGREES HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introduction The local structure of the enumeration degrees G e is the partially ordered set of the
More informationClassification and Measure for Algebraic Fields
Classification and Measure for Algebraic Fields Russell Miller Queens College & CUNY Graduate Center Logic Seminar Cornell University 23 August 2017 Russell Miller (CUNY) Classification of Algebraic Fields
More informationMH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then
MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever
More informationPreliminaries. Introduction to EF-games. Inexpressivity results for first-order logic. Normal forms for first-order logic
Introduction to EF-games Inexpressivity results for first-order logic Normal forms for first-order logic Algorithms and complexity for specific classes of structures General complexity bounds Preliminaries
More informationBanach-Mazur game played in partially ordered sets
Banach-Mazur game played in partially ordered sets arxiv:1505.01094v1 [math.lo] 5 May 2015 Wies law Kubiś Department of Mathematics Jan Kochanowski University in Kielce, Poland and Institute of Mathematics,
More informationWell-foundedness of Countable Ordinals and the Hydra Game
Well-foundedness of Countable Ordinals and the Hydra Game Noah Schoem September 11, 2014 1 Abstract An argument involving the Hydra game shows why ACA 0 is insufficient for a theory of ordinals in which
More informationVARIETIES OF ABELIAN TOPOLOGICAL GROUPS AND SCATTERED SPACES
Bull. Austral. Math. Soc. 78 (2008), 487 495 doi:10.1017/s0004972708000877 VARIETIES OF ABELIAN TOPOLOGICAL GROUPS AND SCATTERED SPACES CAROLYN E. MCPHAIL and SIDNEY A. MORRIS (Received 3 March 2008) Abstract
More informationBoundedly complete weak-cauchy basic sequences in Banach spaces with the PCP
Journal of Functional Analysis 253 (2007) 772 781 www.elsevier.com/locate/jfa Note Boundedly complete weak-cauchy basic sequences in Banach spaces with the PCP Haskell Rosenthal Department of Mathematics,
More informationCORES OF ALEXANDROFF SPACES
CORES OF ALEXANDROFF SPACES XI CHEN Abstract. Following Kukie la, we show how to generalize some results from May s book [4] concerning cores of finite spaces to cores of Alexandroff spaces. It turns out
More informationVALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS
VALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS JAN DOBROWOLSKI AND FRANZ-VIKTOR KUHLMANN Abstract. Using valuation rings and valued fields as examples, we discuss in which ways the notions of
More informationOn the Length of Borel Hierarchies
On the Length of Borel Hierarchies Arnold W. Miller November 7, 2016 This is a survey paper on the lengths of Borel hierarchies and related hierarchies. It consists of lecture notes of a lecture given
More information2 RENATA GRUNBERG A. PRADO AND FRANKLIN D. TALL 1 We thank the referee for a number of useful comments. We need the following result: Theorem 0.1. [2]
CHARACTERIZING! 1 AND THE LONG LINE BY THEIR TOPOLOGICAL ELEMENTARY REFLECTIONS RENATA GRUNBERG A. PRADO AND FRANKLIN D. TALL 1 Abstract. Given a topological space hx; T i 2 M; an elementary submodel of
More informationReverse Mathematics of Topology
Reverse Mathematics of Topology William Chan 1 Abstract. This paper develops the Reverse Mathematics of second countable topologies, where the elements of the topological space exist. The notion of topology,
More informationSOME TRANSFINITE INDUCTION DEDUCTIONS
SOME TRANSFINITE INDUCTION DEDUCTIONS SYLVIA DURIAN Abstract. This paper develops the ordinal numbers and transfinite induction, then demonstrates some interesting applications of transfinite induction.
More informationThe Proper Forcing Axiom: a tutorial
Young Set Theory Workshop 2010, Raach, Austria. The Proper Forcing Axiom: a tutorial Justin Tatch Moore 1 Notes taken by Giorgio Venturi In these notes we will present an exposition of the Proper Forcing
More informationarxiv: v4 [math.lo] 18 Oct 2015
TOPOLOGICAL RAMSEY SPACES FROM FRAÏSSÉ CLASSES, RAMSEY-CLASSIFICATION THEOREMS, AND INITIAL STRUCTURES IN THE TUKEY TYPES OF P-POINTS NATASHA DOBRINEN, JOSÉ G. MIJARES, AND TIMOTHY TRUJILLO arxiv:1401.8105v4
More informationOn the Logarithmic Calculus and Sidorenko s Conjecture
On the Logarithmic Calculus and Sidorenko s Conjecture by Xiang Li A thesis submitted in conformity with the requirements for the degree of Msc. Mathematics Graduate Department of Mathematics University
More informationOn Better-Quasi-Ordering Countable Series-Parallel Orders
On Better-Quasi-Ordering Countable Series-Parallel Orders Stéphan Thomassé Laboratoire LMD, UFR de Mathématiques, Université Claude Bernard 43, Boulevard du 11 novembre 1918, 69622 Villeurbanne Cedex,
More informationSelections and weak orderability
F U N D A M E N T A MATHEMATICAE * (200*) Selections and weak orderability by Michael Hrušák and Iván Martínez-Ruiz (Morelia) Dedicated to Jan Pelant Abstract. We answer a question of van Mill and Wattel
More informationFAR POINTS AND DISCRETELY GENERATED SPACES
FAR POINTS AND DISCRETELY GENERATED SPACES ALAN DOW AND RODRIGO HERNÁNDEZ-GUTIÉRREZ Abstract. We give a partial solution to a question by Alas, Junqueria and Wilson by proving that under PFA the one-point
More informationON UNCONDITIONALLY SATURATED BANACH SPACES. 1. Introduction
ON UNCONDITIONALLY SATURATED BANACH SPACES PANDELIS DODOS AND JORDI LOPEZ-ABAD Abstract. We prove a structural property of the class of unconditionally saturated separable Banach spaces. We show, in particular,
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics COMPLETE EMBEDDINGS OF THE COHEN ALGEBRA INTO THREE FAMILIES OF C.C.C. NON-MEASURABLE BOOLEAN ALGEBRAS Natasha Dobrinen Volume 214 No. 2 April 2004 PACIFIC JOURNAL OF MATHEMATICS
More informationPRODUCTS OF SPECIAL SETS OF REAL NUMBERS
Real Analysis Exchange Vol. 30(2), 2004/2005, pp. 819 836 Boaz Tsaban, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot 76100, Israel. email: boaz.tsaban@weizmann.ac.il
More informationULTRAFILTER AND HINDMAN S THEOREM
ULTRAFILTER AND HINDMAN S THEOREM GUANYU ZHOU Abstract. In this paper, we present various results of Ramsey Theory, including Schur s Theorem and Hindman s Theorem. With the focus on the proof of Hindman
More informationALGEBRAIC SUMS OF SETS IN MARCZEWSKI BURSTIN ALGEBRAS
François G. Dorais, Department of Mathematics, Dartmouth College, 6188 Bradley Hall, Hanover, NH 03755, USA (e-mail: francois.g.dorais@dartmouth.edu) Rafa l Filipów, Institute of Mathematics, University
More informationA UNIVERSAL SEQUENCE OF CONTINUOUS FUNCTIONS
A UNIVERSAL SEQUENCE OF CONTINUOUS FUNCTIONS STEVO TODORCEVIC Abstract. We show that for each positive integer k there is a sequence F n : R k R of continuous functions which represents via point-wise
More informationPropositional and Predicate Logic - IV
Propositional and Predicate Logic - IV Petr Gregor KTIML MFF UK ZS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - IV ZS 2015/2016 1 / 19 Tableau method (from the previous lecture)
More informationMost Continuous Functions are Nowhere Differentiable
Most Continuous Functions are Nowhere Differentiable Spring 2004 The Space of Continuous Functions Let K = [0, 1] and let C(K) be the set of all continuous functions f : K R. Definition 1 For f C(K) we
More informationGROUPS DEFINABLE IN O-MINIMAL STRUCTURES
GROUPS DEFINABLE IN O-MINIMAL STRUCTURES PANTELIS E. ELEFTHERIOU Abstract. In this series of lectures, we will a) introduce the basics of o- minimality, b) describe the manifold topology of groups definable
More informationSlow P -point Ultrafilters
Slow P -point Ultrafilters Renling Jin College of Charleston jinr@cofc.edu Abstract We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin s Axiom,
More information