Publication Date:
2019
Description:
〈p〉Publication date: Available online 28 February 2019〈/p〉
〈p〉〈b〉Source:〈/b〉 Topology and its Applications〈/p〉
〈p〉Author(s): Neil Hindman, Dona Strauss〈/p〉
〈h5〉Abstract〈/h5〉
〈div〉〈p〉Let 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"〉〈mo stretchy="false"〉(〈/mo〉〈mi〉S〈/mi〉〈mo〉,〈/mo〉〈mo〉+〈/mo〉〈mo stretchy="false"〉)〈/mo〉〈/math〉 be an infinite commutative semigroup with identity 0. Let 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" overflow="scroll"〉〈mi〉u〈/mi〉〈mo〉,〈/mo〉〈mi〉v〈/mi〉〈mo〉∈〈/mo〉〈mi mathvariant="double-struck"〉N〈/mi〉〈/math〉 and let 〈em〉A〈/em〉 be a 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si3.gif" overflow="scroll"〉〈mi〉u〈/mi〉〈mo〉×〈/mo〉〈mi〉v〈/mi〉〈/math〉 matrix with nonnegative integer entries. If 〈em〉S〈/em〉 is cancellative, let the entries of 〈em〉A〈/em〉 come from 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si295.gif" overflow="scroll"〉〈mi mathvariant="double-struck"〉Z〈/mi〉〈/math〉. Then 〈em〉A〈/em〉 is 〈em〉image partition regular over S〈/em〉 (〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si449.gif" overflow="scroll"〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi〉S〈/mi〉〈/math〉) iff whenever 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si450.gif" overflow="scroll"〉〈mi〉S〈/mi〉〈mo〉∖〈/mo〉〈mo stretchy="false"〉{〈/mo〉〈mn〉0〈/mn〉〈mo stretchy="false"〉}〈/mo〉〈/math〉 is finitely colored, there exists 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si10.gif" overflow="scroll"〉〈mover accent="true"〉〈mrow〉〈mi〉x〈/mi〉〈/mrow〉〈mrow〉〈mo stretchy="false"〉→〈/mo〉〈/mrow〉〈/mover〉〈mo〉∈〈/mo〉〈msup〉〈mrow〉〈mo stretchy="false"〉(〈/mo〉〈mi〉S〈/mi〉〈mo〉∖〈/mo〉〈mo stretchy="false"〉{〈/mo〉〈mn〉0〈/mn〉〈mo stretchy="false"〉}〈/mo〉〈mo stretchy="false"〉)〈/mo〉〈/mrow〉〈mrow〉〈mi〉v〈/mi〉〈/mrow〉〈/msup〉〈/math〉 such that the entries of 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si406.gif" overflow="scroll"〉〈mi〉A〈/mi〉〈mover accent="true"〉〈mrow〉〈mi〉x〈/mi〉〈/mrow〉〈mrow〉〈mo stretchy="false"〉→〈/mo〉〈/mrow〉〈/mover〉〈/math〉 are monochromatic. The matrix 〈em〉A〈/em〉 is 〈em〉centrally image partition regular over S〈/em〉 (〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si317.gif" overflow="scroll"〉〈mi〉C〈/mi〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi〉S〈/mi〉〈/math〉) iff whenever 〈em〉C〈/em〉 is a central subset of 〈em〉S〈/em〉, there exists 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si10.gif" overflow="scroll"〉〈mover accent="true"〉〈mrow〉〈mi〉x〈/mi〉〈/mrow〉〈mrow〉〈mo stretchy="false"〉→〈/mo〉〈/mrow〉〈/mover〉〈mo〉∈〈/mo〉〈msup〉〈mrow〉〈mo stretchy="false"〉(〈/mo〉〈mi〉S〈/mi〉〈mo〉∖〈/mo〉〈mo stretchy="false"〉{〈/mo〉〈mn〉0〈/mn〉〈mo stretchy="false"〉}〈/mo〉〈mo stretchy="false"〉)〈/mo〉〈/mrow〉〈mrow〉〈mi〉v〈/mi〉〈/mrow〉〈/msup〉〈/math〉 such that 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si11.gif" overflow="scroll"〉〈mi〉A〈/mi〉〈mover accent="true"〉〈mrow〉〈mi〉x〈/mi〉〈/mrow〉〈mrow〉〈mo stretchy="false"〉→〈/mo〉〈/mrow〉〈/mover〉〈mo〉∈〈/mo〉〈msup〉〈mrow〉〈mi〉C〈/mi〉〈/mrow〉〈mrow〉〈mi〉u〈/mi〉〈/mrow〉〈/msup〉〈/math〉. These notions have been extensively studied for subsemigroups of 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si12.gif" overflow="scroll"〉〈mo stretchy="false"〉(〈/mo〉〈mi mathvariant="double-struck"〉R〈/mi〉〈mo〉,〈/mo〉〈mo〉+〈/mo〉〈mo stretchy="false"〉)〈/mo〉〈/math〉 or 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si13.gif" overflow="scroll"〉〈mo stretchy="false"〉(〈/mo〉〈mi mathvariant="double-struck"〉R〈/mi〉〈mo〉,〈/mo〉〈mo〉⋅〈/mo〉〈mo stretchy="false"〉)〈/mo〉〈/math〉. We obtain some necessary and some sufficient conditions for 〈em〉A〈/em〉 to be 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si449.gif" overflow="scroll"〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi〉S〈/mi〉〈/math〉 or 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si317.gif" overflow="scroll"〉〈mi〉C〈/mi〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi〉S〈/mi〉〈/math〉. For example, if 〈em〉G〈/em〉 is an infinite divisible group, then 〈em〉A〈/em〉 is 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si14.gif" overflow="scroll"〉〈mi〉C〈/mi〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi〉G〈/mi〉〈/math〉 iff 〈em〉A〈/em〉 is 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si15.gif" overflow="scroll"〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi mathvariant="double-struck"〉Z〈/mi〉〈/math〉. If for all 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si16.gif" overflow="scroll"〉〈mi〉c〈/mi〉〈mo〉∈〈/mo〉〈mi mathvariant="double-struck"〉N〈/mi〉〈/math〉, 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si17.gif" overflow="scroll"〉〈mi〉c〈/mi〉〈mi〉S〈/mi〉〈mo〉≠〈/mo〉〈mo stretchy="false"〉{〈/mo〉〈mn〉0〈/mn〉〈mo stretchy="false"〉}〈/mo〉〈/math〉 and 〈em〉A〈/em〉 is 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si18.gif" overflow="scroll"〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi mathvariant="double-struck"〉N〈/mi〉〈/math〉, then 〈em〉A〈/em〉 is 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si449.gif" overflow="scroll"〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi〉S〈/mi〉〈/math〉. If 〈em〉S〈/em〉 is cancellative, 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si16.gif" overflow="scroll"〉〈mi〉c〈/mi〉〈mo〉∈〈/mo〉〈mi mathvariant="double-struck"〉N〈/mi〉〈/math〉, and 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si19.gif" overflow="scroll"〉〈mi〉c〈/mi〉〈mi〉S〈/mi〉〈mo〉=〈/mo〉〈mo stretchy="false"〉{〈/mo〉〈mn〉0〈/mn〉〈mo stretchy="false"〉}〈/mo〉〈/math〉, we obtain a simple sufficient condition for 〈em〉A〈/em〉 to be 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si449.gif" overflow="scroll"〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi〉S〈/mi〉〈/math〉. It is well-known that 〈em〉A〈/em〉 is 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si449.gif" overflow="scroll"〉〈mi〉I〈/mi〉〈mi〉P〈/mi〉〈mi〉R〈/mi〉〈mo stretchy="false"〉/〈/mo〉〈mi〉S〈/mi〉〈/math〉 if 〈em〉A〈/em〉 is a first entries matrix with the property that 〈em〉cS〈/em〉 is a central〈sup〉⁎〈/sup〉 subset of 〈em〉S〈/em〉 for every first entry 〈em〉c〈/em〉 of 〈em〉A〈/em〉. We extend this theorem to first entries matrices whose first entries may not satisfy this condition. We discuss whether, if 〈em〉S〈/em〉 is finitely colored, there exists 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si10.gif" overflow="scroll"〉〈mover accent="true"〉〈mrow〉〈mi〉x〈/mi〉〈/mrow〉〈mrow〉〈mo stretchy="false"〉→〈/mo〉〈/mrow〉〈/mover〉〈mo〉∈〈/mo〉〈msup〉〈mrow〉〈mo stretchy="false"〉(〈/mo〉〈mi〉S〈/mi〉〈mo〉∖〈/mo〉〈mo stretchy="false"〉{〈/mo〉〈mn〉0〈/mn〉〈mo stretchy="false"〉}〈/mo〉〈mo stretchy="false"〉)〈/mo〉〈/mrow〉〈mrow〉〈mi〉v〈/mi〉〈/mrow〉〈/msup〉〈/math〉, with distinct entries, for which the entries of 〈math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si406.gif" overflow="scroll"〉〈mi〉A〈/mi〉〈mover accent="true"〉〈mrow〉〈mi〉x〈/mi〉〈/mrow〉〈mrow〉〈mo stretchy="false"〉→〈/mo〉〈/mrow〉〈/mover〉〈/math〉 are monochromatic and distinct. Along the way, we obtain several new results about the algebra of 〈em〉βS〈/em〉, the Stone-Čech compactification of the discrete semigroup 〈em〉S〈/em〉.〈/p〉〈/div〉
Print ISSN:
0166-8641
Electronic ISSN:
1879-3207
Topics:
Mathematics
Permalink