Monocromaticity of additive and multiplicative central sets and Goswami's theorem in large Integral Domains
Abstract
In Fi A. Fish proved that if E1 and E2 are two subsets of Z of positive upper Banach density, then there exists k∈Z0 such that k·Z⊂(E1-E1)·(E2-E2). In G, S. Goswami proved the same but a fundamental result on the set of prime numbers P in N and proved that for some k∈N, k·N⊂(P-P)·(P-P). To do so, Goswami mainly proved that the product of an IP-set with an IPr-set contains kN. This result is very important and surprising to mathematicians who are aware of combinatorially rich sets. In this article, we extend Goswami's result to large Lntegral Domain, that behave like N in the sense of some combinatorics. We prove that for a combinatorially rich (CR-set) set, A, for some k∈N, k·N⊂(A-A)·(A-A). We provide a new proof that if we partition a large Integral Domain, R, into finitely many cells, then at least one cell is both additive and multiplicative central, and we prove the converse part, which is a new and unknown result.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.