Let A, B be sets; \(A_ 1,...,A_ m\) and \(B_ 1,...,B_ n\) be partitions of A and B. The partition of \(A\times B\) by the sets \(A_ i\times B_ i\) is called an \(m\times n\) simple product coloring (SPC). There is a \(3\times 3\) SPC of \({\mathbb{R}}^ 2\) with no two points distance 1 apart having the same color (i.e. forbidding distance 1). i) There is a \(2\times 2\) SPC of \(Q^ 2\), a \(2\times 2\times 2\) SPC of \(Q^ 3\) forbidding distance 1. ii) No such \(2^ k\) SPC of \(Q^ k\) for \(k>3\) exists. iii) There is no \(2\times 2\) SPC of \({\mathbb{R}}^ 2\) forbidding distance 1. Is there such a \(2\times 3\) SPC of \({\mathbb{R}}^ 2?\) The problem is posed whether there is a generalized product coloring of \({\mathbb{R}}^ 2\) forbidding distance 1.
- Distances forbidden by some two-coloring of \(\mathbb{Q}^ 2\)
- Colorings of the space \(\mathbb R^{n}\) with several forbidden distances
- Distances forbidden by two-colorings of \(\mathbb{Q}^ 3\) and \(A_ n\)
- Two-colorings of a dense subgroup of \({\mathbb{Q}}^ n\) that forbid many distances
- scientific article; zbMATH DE number 866014
This page was built for publication: Simple product colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793736)
