Concerning partition regular matrices

Abstract

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 Ax are in some color class. In [6] and [8], the notion of centrally image partition regular matrices were introduced to extend the results of finite image partition regular matrices to infinite image partition regular matrices. It was shown that centrally image partition regular matrices are closed under diagonal sum. In the present paper, we show that the diagonal sum of two matrices, one of which comes from the class of all Milliken-Taylor matrices and the other from a suitable subclass of the class of all centrally image partition regular matrices is also image partition regular. This will produce more image partition regular matrices. We also study the multiple structures within one cell of a finite partition of N ·

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…