Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-23T00:48:53.661Z Has data issue: false hasContentIssue false

SEPARATING MILLIKEN–TAYLOR SYSTEMS WITH NEGATIVE ENTRIES

Published online by Cambridge University Press:  27 January 2003

Neil Hindman
Affiliation:
Department of Mathematics, Howard University, Washington, DC 20059, USA ([email protected])
Imre Leader
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Road, Cambridge CB3 0WB, UK ([email protected])
Dona Strauss
Affiliation:
Department of Pure Mathematics, University of Hull, Hull HU6 7RX, UK ([email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Given a finite sequence $\bm{a}=\langle a_i\rangle_{i=1}^n$ in $\mathbb{N}$ and a sequence $\langle x_t\rangle_{t=1}^\infty$ in $\mathbb{N}$, the Milliken–Taylor system generated by $\bm{a}$ and $\langle x_t\rangle_{t=1}^\infty$ is

\begin{multline*} \qquad \mathrm{MT}(\bm{a},\langle x_t\rangle_{t=1}^\infty)=\biggl\{\sum_{i=1}^na_i\cdot\sum_{t\in F_i}x_t:F_1,F_2,\dots,F_n\text{ are finite non-empty} \\[-8pt] \text{subsets of $\mathbb{N}$ with }\max F_i\lt\min F_{i+1}\text{ for }i\ltn\biggr\}.\qquad \end{multline*}

It is known that Milliken–Taylor systems are partition regular but not consistent. More precisely, if $\bm{a}$ and $\bm{b}$ are finite sequences in $\mathbb{N}$, then, except in trivial cases, there is a partition of $\mathbb{N}$ into two cells, neither of which contains $\mathrm{MT}(\bm{a},\langle x_t\rangle_{t=1}^\infty)\cup \mathrm{MT}(\bm{b},\langle y_t\rangle_{t=1}^\infty)$ for any sequences $\langle x_t\rangle_{t=1}^\infty$ and $\langle y_t\rangle_{t=1}^\infty$.

Our aim in this paper is to extend the above result to allow negative entries in $\bm{a}$ and $\bm{b}$. We do so with a proof which is significantly shorter and simpler than the original proof which applied only to positive coefficients. We also derive some results concerning the existence of solutions of certain linear equations in $\beta\mathbb{Z}$. In particular, we show that the ability to guarantee the existence of $\mathrm{MT}(\bm{a},\langle x_t\rangle_{t=1}^\infty)\cup \mathrm{MT}(\bm{b},\langle y_t\rangle_{t=1}^\infty)$ in one cell of a partition is equivalent to the ability to find idempotents $p$ and $q$ in $\beta\mathbb{N}$ such that $a_1\cdot p+a_2\cdot p+\cdots+a_n\cdot p=b_1\cdot q+b_2\cdot q+\cdots+b_m\cdot q$, and thus determine exactly when the latter has a solution.

AMS 2000 Mathematics subject classification: Primary 05D10. Secondary 22A15; 54H13

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 2003