Cartesian products of two CR sets
For any nonempty set \(X\), \(P_f(X)\) denote the set of all nonempty finite subsets of \(X\). Let \((S,.)\) be an arbitrary semigroup. A set \(A\subseteq S\) is said to be a combinatorially rich set (CR-set) if and only if for each \(k \in \mathbb{N}\), there exists \(r \in \mathbb{N}\) such that whenever \(F \in P_f(\mathbb{N})\) with \(|F| \leq k\), there exist \(m \in \mathbb{N}\), \(a \in S^{m+1}\), and \(t(1) < t(2) < \dots < t(m) \leq r\) in \(\mathbb{N}\) such that for each \(f \in F\), \(a(1)\cdot f(t(1)\cdot a(2)\cdot f t(2)\cdot a(3)\cdot \dots \cdot a(m)\cdot f t(m))\cdot a(m + 1) \in A\).\N\NThe authors prove the product of two CR sets is again a CR set. i.e., Let \(S\) and \(T\) be semigroups, let \(A\) be a CR-set in \(S\), and let \(B\) be a CR-set in \(T\). Then \(A \times B\) is a CR-set in \(S \times T\).
- Algebra in the Stone-Čech compactification. Theory and applications
- Beweis einer Baudetschen Vermutung.
- Cartesian products of some combinatorially rich sets
- Combinatorially rich sets in arbitrary semigroups
- Finite sums from sequences within cells of a partition of N
- scientific article; zbMATH DE number 5610714 (Why is no real title available?)
- On the interplay between additive and multiplicative largeness and its combinatorial applications
- Polynomial extension of the stronger central sets theorem
- Polynomial recurrence with large intersection over countable fields
This page was built for publication: Cartesian products of two CR sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582354)
