Large sets containing copies of small sets
One of the typical combinatorial problems is the question if any sufficiently large set contains a subset of a given size having a given property. The famous theorems in this branch are the Ramsey and van der Waerden ones. The author investigates a problem of this type, where the size and property of the included set is ``to be geometrically similar to a fixed set of real numbers (\(X\), \(Y\) subsets of real numbers are similar if there exist real numbers \(b\) and \(c\), \(c\neq 0\), s.t. \(Y=\{ cx+b; x\in X\}\)). And ``sufficiently large is investigated as to be uncountable, to be open, second Baire property or of positive Lebesgue measure. The author describes both the related results from the literature and his own ones. The matter relates to an Erdös problem. The paper is written in a quite friendly and comprehensible way. It contains sufficient quotation to the matter.
- Some results on similarities in \({\mathbb{R}}^ n\)
- The Erdős similarity problem: a survey
- On sets containing an affine copy of bounded decreasing sequences
- Structural results for planar sets with many similar subsets
- The density of sets containing large similar copies of finite sets
- Arithmetic progressions in the graphs of slightly curved sequences
- Some Results Connected with a Problem of Erdos. III
- scientific article; zbMATH DE number 2075780 (Why is no real title available?)
- Big Sets
- Fifty years of the Erdős similarity conjecture
- On the Eigen-Falconer theorem in \(\mathbb{R}^d\)
This page was built for publication: Large sets containing copies of small sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374563)
