Abstract
We consider infinite matrices with entries fromℤ (and only finitely many nonzero entries on any row). A matrixA is partition regular overℕ provided that, whenever the setℕ of positive integers is partitioned into finitely many classes there is a vector\(\overrightarrow x\) with entries inℤ such that all entries ofA \(A\overrightarrow x\) lie in the same cell of the partition. We show that, in marked contrast with the situation for finite matrices, there exists a finite partition ofℕ no cell of which contains solutions for all partition regular matrices and determine which of our pairs of matrices must always have solutions in the same cell of a partition.
Similar content being viewed by others
References
V. Bergelson, andN. Hindman: A combinatorially large cell of a partition ofN, J. Comb. Theory (Series A).48 (1988), 39–52.
W. Deuber: Partitionen und lineare Gleichungssysteme,Math. Z. 133 (1973), 109–123.
W. Deuber, andN. Hindman: Partitions and sums of (m,p,c)-sets,J. Comb. Theory (Series A)45 (1987), 300–302.
R. Ellis: Lectures on topological dynamics, Benjamin, New York, 1969.
N. Hindman: Ultrafilters and Combinatorial number theory, inNumber Theory Carbondale 1979, M. Nathansen ed., Lecture Notes in Math.151 (1979), 119–184.
N. Hindman, andI. Leader: Image partition regularity of matrices,Comb. Prob. and Comp. 2 (1993), 437–463.
N. Hindman, andH. Lefmann: Partition Regularity of (M,P,C)-systems,J. Comb. Theory (Series A),64 (1993), 1–9.
K. Milliken: Ramsey's Theorem with sums or unions,J. Comb. Theory (Series A)18 (1975), 276–290.
A. Taylor: A canonical partition relation for finite subsets of ω,J. Comb. Theory (Series A),21 (1976), 137–146.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Deuber, W.A., Hindman, N., Leader, I. et al. Infinite partition regular matrices. Combinatorica 15, 333–355 (1995). https://doi.org/10.1007/BF01299740
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01299740