Vector sets with no repeated differences
Komjáth, Péter
Colloquium Mathematicae, Tome 66 (1993), p. 129-134 / Harvested from The Polish Digital Mathematics Library

We consider the question when a set in a vector space over the rationals, with no differences occurring more than twice, is the union of countably many sets, none containing a difference twice. The answer is “yes” if the set is of size at most 2, “not” if the set is allowed to be of size (220)+. It is consistent that the continuum is large, but the statement still holds for every set smaller than continuum.

Publié le : 1993-01-01
EUDML-ID : urn:eudml:doc:210162
@article{bwmeta1.element.bwnjournal-article-cmv64i1p129bwm,
     author = {P\'eter Komj\'ath},
     title = {Vector sets with no repeated differences},
     journal = {Colloquium Mathematicae},
     volume = {66},
     year = {1993},
     pages = {129-134},
     zbl = {0830.03020},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-cmv64i1p129bwm}
}
Komjáth, Péter. Vector sets with no repeated differences. Colloquium Mathematicae, Tome 66 (1993) pp. 129-134. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-cmv64i1p129bwm/

[000] [1] P. Erdős, Set theoretic, measure theoretic, combinatorial, and number theoretic problems concerning point sets in Euclidean space, Real Anal. Exchange 4 (1978-79), 113-138. | Zbl 0418.04002

[001] [2] P. Erdős, Some applications of Ramsey's theorem to additive number theory, European J. Combin. 1 (1980), 43-46. | Zbl 0442.10037

[002] [3] P. Erdős and S. Kakutani, On non-denumerable graphs, Bull. Amer. Math. Soc. 49 (1943), 457-461. | Zbl 0063.01275

[003] [4] P. Erdős and R. Rado, A partition calculus in set theory, ibid. 62 (1956), 427-489. | Zbl 0071.05105

[004] [5] D. Fremlin, Consequences of Martin's Axiom, Cambridge University Press, 1984. | Zbl 0551.03033