{"paper":{"title":"Infinite image partition regular matrices - Solution in C-sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sourav Kanti Patra, Sukrit Chakraborty","submitted_at":"2018-03-17T12:31:01Z","abstract_excerpt":"A finite or infinite matrix $A$ is image partition regular provided that whenever $\\mathbb{N}$ is finitely colored, there must be some $\\overset{\\rightarrow}{x}$ with entries from $\\mathbb{N}$ such that all entries of $A \\overset{\\rightarrow}{x}$ are in the same color class. Comparing to the finite case, infinite image partition regular matrices seem more harder to analyze. The concept of centrally image partition regular matrices were introduced to extend the results of finite image partition regular matrices to infinite one. In this paper, we shall introduce the notion of C-image partition r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01051","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}