Concerning partition regular matrices
Sourav Kanti Patra, Swapan Kumar Ghosh

TL;DR
This paper explores the properties of infinite image partition regular matrices, especially their behavior under diagonal sums, and introduces new classes of such matrices to generate more examples.
Contribution
It extends the theory of image partition regular matrices by analyzing their diagonal sums involving Milliken-Taylor and centrally image partition regular matrices.
Findings
Diagonal sum of Milliken-Taylor and certain centrally image partition regular matrices is also image partition regular.
Centrally image partition regular matrices are closed under diagonal sum.
New classes of image partition regular matrices are constructed.
Abstract
A finite or infinite matrix is image partition regular provided that whenever is finitely colored, there must be some with entries from such that all entries of 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems
