Dona Strauss

Learn More
Previous research extending over a few decades has established that multi-plicatively large sets (in any of several interpretations) must have substantial additive structure. We investigate here the question of how much multiplicative structure can be found in additively large sets. For example, we show that any translate of a set of finite sums from an(More)
A finite or infinite matrix A with rational entries is called partition regular if whenever the natural numbers are finitely coloured there is a monochromatic vector x with Ax = 0. Many of the classical theorems of Ramsey Theory may naturally be interpreted as assertions that particular matrices are partition regular. While in the finite case partition(More)
As published there were gaps in the proofs that (a) implies (d) and that (b) implies (c) in Theorem 2.10. These gaps have been filled here. Other than that, to the best of my knowledge, this is the final version as it was submitted to the publisher. – NH Abstract A u × v matrix A is image partition regular provided that, whenever N is finitely colored,(More)
Recently, in conversation with Erd˝ os, Hajnal asked whether or not for any triangle-free graph G on the vertex set N, there always exists a sequence x n ∞ n=1 so that whenever F and H are distinct finite nonempty subsets of N, {Σ n∈F x n , Σ n∈H x n } is not an edge of G (that is, F S(x n ∞ n=1) is an independent set). We answer this question in the(More)
Deuber's Theorem says that, given any m, p, c, r in N, there exist n, q, µ in N such that whenever an (n, q, c µ)-set is r-coloured, there is a monochrome (m, p, c)-set. This theorem has been used in conjunction with the algebraic structure of the Stone-ˇ Cech compactification βN of N to derive several strengthenings of itself. We present here an algebraic(More)
Central sets in semigroups are known to have very rich combinato-rial structure, described by the " Central Sets Theorem ". It has been unknown whether the Central Sets Theorem in fact characterizes central sets, and if not whether some other combinatorial characterization could be found. We derive here a combinatorial characterization of central sets and(More)
A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S \ {0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some time that there is an infinite system of linear equations that is partition regular over R but not over Q, and it was(More)
A finite or infinite matrix A with rational entries (and only finitely many non-zero entries in each row) is called image partition regular if, whenever the natural numbers are finitely coloured, there is a vector x, with entries in the natural numbers, such that Ax is monochromatic. Many of the classical results of Ramsey theory are naturally stated in(More)
Let A be a finite matrix with rational entries. We say that A is doubly image partition regular if whenever the set N of positive integers is finitely coloured, there exists x such that the entries of A x are all the same colour (or monochromatic) and also, the entries of x are monochromatic. Which matrices are doubly image partition regular? More(More)