A construction of subsets of the reals which have a similarity decomposition

DOI10.1007/S11083-008-9079-3MaRDI QIDQ943370zbMATH OpenOpenAlexFDO

Authors Egbert Harzheim

Publication date 9 September 2008

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11083-008-9079-3

zbMATH Keywords

similarity decomposition

Mathematics Subject Classification ID

Total orders (06A05) Combinatorics of partially ordered sets (06A07)

Review text

A set \(E \subseteq \mathbb{R}\) has a similarity decomposition if \(E\) is the union of \(2^{\aleph_0}\) pairwise disjoint subsets \(E_{\xi}\) where each \(E_{\xi}\) is order-isomorphic to \(E\). The author constructs a set \(E\) which has a similarity decomposition and has an order type less than that of \(\mathbb{R}\). This solves an old problem of Ginsburg's.

Recommendations

• Construction of one-dimensional subsets of the reals not containing similar copies of given patterns
• scientific article; zbMATH DE number 3941837
• scientific article; zbMATH DE number 3972864
• scientific article; zbMATH DE number 1492362
• Partitions of a segment into sets of the same type

Cites work

• Some Remarks on Order Types and Decompositions of Sets

This page was built for publication: A construction of subsets of the reals which have a similarity decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943370)