Partition regularity of a system of De and Hindman
Ben Barber

TL;DR
This paper demonstrates that a specific matrix, not partition regular over real numbers near zero, is partition regular over natural numbers, resolving a question posed by De and Hindman.
Contribution
It establishes the partition regularity of a matrix over natural numbers despite its non-regularity over reals near zero, answering an open question.
Findings
Matrix is not image partition regular over R near zero.
Matrix is image partition regular over N.
Addresses a question of De and Hindman.
Abstract
We prove that a certain matrix, which is not image partition regular over R near zero, is image partition regular over N. This answers a question of De and Hindman.
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 applications · Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory
