#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1995

2015

- This year (0)
- Last 5 years (4)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Neil Hindman, Imre Leader, Dona Strauss
- Combinatorics, Probability & Computing
- 2003

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)

- H. G. Dales, D. Strauss
- 2008

- Mathias Beiglböck, Vitaly Bergelson, Neil Hindman, Dona Strauss
- J. Comb. Theory, Ser. A
- 2006

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)

We show that if (S, +) is a commutative semigroup which can be embedded in the circle group T, in particular if S = (N, +), then all nonprincipal, strongly summable ultrafilters on S are sparse and can be written as sums in βS only trivially. We develop a simple condition on a strongly summable ultrafilter which guarantees that it is sparse and show that… (More)

- Neil Hindman, Imre Leader, Dona Strauss
- Discrete Mathematics
- 2002

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)

- Walter A. Deuber, David S. Gunderson, Neil Hindman, Dona Strauss
- J. Comb. Theory, Ser. A
- 1997

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)

- H. G. Dales, D. Strauss
- 2007

- Dona Strauss
- 2005

There is only one reasonable definition of kernel partition regularity over any subsemigroup of the reals. On the other hand, there are several reasonable definitions of image partition regularity. We establish the exact relationships that can hold among these various notions for finite matrices and infinite matrices with rational entries. We also introduce… (More)

- Neil Hindman, Dona Strauss
- 2002

A finite or infinite matrix A is image partition regular provided that whenever N is finitely colored, there must be some x with entries from N such that all entries of A x are in the same color class. Using the algebraic structure of the Stone-ˇ Cech compactification βN of N, along with a good deal of elementary combinatorics, we investigate the degree to… (More)

- Neil Hindman, Amir Maleki, Dona Strauss
- J. Comb. Theory, Ser. A
- 1996

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)