Finding Product and Sum Patterns in non-commutative settings
Combinatorics
2024-05-01 v1
Abstract
Hindman conjectured that any finite partition of has a monochromatic . Recently, Bowen proved the result for all 2-partition. In this paper, we extend Bowen's result to any semiring such that is piecewise syndetic for all . As a method, we gave a combinatorial proof for a piecewise syndetic version of Bergerson and Glasscock's IP Szemer\'edi Theorem, and discussed the case when the operation is not commutative.
Cite
@article{arxiv.2404.19650,
title = {Finding Product and Sum Patterns in non-commutative settings},
author = {T. Y. Tao and Neil N. Y. Yang},
journal= {arXiv preprint arXiv:2404.19650},
year = {2024}
}
Comments
18 pages