ArticleOriginal scientific text

Title

Vector sets with no repeated differences

Authors 1

Affiliations

  1. Department of Computer Science, R. Eötvös University, Múzeum Krt. 6-8, 1088 Budapest, Hungary

Abstract

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.

Bibliography

  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.
  2. P. Erdős, Some applications of Ramsey's theorem to additive number theory, European J. Combin. 1 (1980), 43-46.
  3. P. Erdős and S. Kakutani, On non-denumerable graphs, Bull. Amer. Math. Soc. 49 (1943), 457-461.
  4. P. Erdős and R. Rado, A partition calculus in set theory, ibid. 62 (1956), 427-489.
  5. D. Fremlin, Consequences of Martin's Axiom, Cambridge University Press, 1984.
Pages:
129-134
Main language of publication
English
Received
1991-06-20
Accepted
1992-03-03
Published
1993
Exact and natural sciences