Canonical partition theorems for parameter sets
نویسندگان
چکیده
منابع مشابه
Canonical Partition Theorems for Parameter Sets
A canonical (i.e., unrestricted) version of the partition theorem for k-parameter sets of Graham and Rothschild (Trans. Amer. Math. Sot. 159 (1971), 257-291) is proven. Some applications, e.g., canonical versions. of the Rado-Folkman-Sanders theorem and of the partition theorem for finite Boolean algebras are given. Also the ErdBs-Rado canonization theorem (J. London Math. Sot. 25 (1950), 249-2...
متن کاملPartition theorems for factorisations of ascending parameter words
We prove, in primitive recursive arithmetic, an extension of a theorem established by Milliken and independently by Neget~il and R6dl on partitions of fixed rank partitions of a finite set. In this way we depict the preservation of structure under partitions of the outcomes of substitution systems, which can also undergo various stage transitions.
متن کاملPartition Theorems for Subsets of Vector Spaces
1. INTRODUCTION II [1] two of us iivestigated the problem of determiiiig those cardiials a, /3, y, 8, A for which the followiig statemeet, abbreviated Iá(8, g, a, A, y), holds : "Wheeever V is aa a-dimeesiooal vector space over a field of A elemeets, aad the 8-dimeesiooal subspaces of V are partitiooed iito y classes, there is some /-dimeesiooal subspace of V all of whose 8-dimee-siooal subspac...
متن کاملPartition Theorems for Layered Partial Semigroups
We introduce the notions of layered semigroups and partial semigroups, and prove some Ramsey type partition results about them. These results generalize previous results of Gowers [5, Theorem 1], of Furstenberg [3, Proposition 8.21], and of Bergelson, Blass, and Hindman [1, Theorem 4.1]. We give some applications of these results (see e.g., Theorem 1.1), and present examples suggesting that our...
متن کاملA canonical partition theorem for trees
We show that for every positive integer d, every downwards closed subtree T of d without terminal nodes and every finite weakly embedded subtree A of T there is a finite list of equivalence relations on Em(T ) with the property that for every other equivalence relation E on Em(T ) there is a strongly embedded subtree S ⊆ T of height ω, such that E Em(S) is equal to one of the equivalence relati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1983
ISSN: 0097-3165
DOI: 10.1016/0097-3165(83)90016-x