Skip to main content
SpringerLink
Log in

Set Theoretic Constructions in Euclidean Spaces

  • Chapter
New Trends in Discrete and Computational Geometry

Part of the book series: Algorithms and Combinatorics ((AC,volume 10))

Abstract

The most important methods of constructing, via the axiom of choice, various sets and decompositions in Euclidean spaces, omitting some geometrical configurations are surveyed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Bagemihl, P. Erdös: Intersections of prescribed power, type, or measure. Fund. Math. 41 (1954) 57–67

    MathSciNet  MATH  Google Scholar 

  2. St. Banach: Sur les transformations biunivoques. Fund. Math. 19 (1932) 10–16

    Google Scholar 

  3. St. Banach, A. Tarski: Sur la décomposition des ensembles de points en parties respectivement congruentes. Fund. Math. 6 (1924) 244–277

    Google Scholar 

  4. P. Bankston, R. Fox: Topological partitions of Euclidean space by spheres. Amer. Math. Monthly 92 (1985) 423–424

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Bankston, R. McGovern: Topological partitions. General Topology and Appl. 10 (1979) 215–229

    Article  MathSciNet  Google Scholar 

  6. G.M. Bergman, E. Hrushovski: Identities of Cofinal Sublattices. Order 2 (1985) 173–191

    Article  MathSciNet  MATH  Google Scholar 

  7. B. Bollobás: Graph theory, An introductory course. Springer, 1979

    MATH  Google Scholar 

  8. J. Ceder: Finite subsets and countable decompositions of Euclidean spaces. Rev. Roum. Math. Pures et Appl. 14 (1969) 1247–1251

    MathSciNet  MATH  Google Scholar 

  9. J.H. Conway, H.T. Croft: Covering a sphere with congruent great-circle arcs. Proc. Cambridge Philos. Soc. 60 (1964) 787–800

    Article  MathSciNet  MATH  Google Scholar 

  10. R.O. Davies: Equivalence to the CH of a certain proposition of elementary plane geometry. Zeitschr. für Math. Logic und Grundlagen Math. 8 (1962) 109–111

    Article  MATH  Google Scholar 

  11. R.O. Davies: On a problem of Erdös concerning decomposition of the plane. Proc. Camb. Phil. Soc. 59 (1963) 33–36

    Article  MATH  Google Scholar 

  12. R.O. Davies: On a denumerable partition problem of Erdös. Proc. Camb. Phil. Soc. 59 (1963) 501–502

    Article  MATH  Google Scholar 

  13. R.O. Davies: The power of continuum and some propositions of plane geometry. Fund. Math. 52 (1963) 277–281

    MathSciNet  MATH  Google Scholar 

  14. R.O. Davies: Covering the plane with denumerably many curves. J. London Math. Soc. 38 (1963) 343–348

    Google Scholar 

  15. R.O. Davies: Partitioning the plane into denumerably many sets without repeated distances. Math. Proc. Camb. Phil. Soc. 72 (1972) 179–183

    Article  MATH  Google Scholar 

  16. R.O. Davies: Covering space with denumerably many curves. Bull. London Math. Soc. 6 (1974) 189–190

    Article  MathSciNet  MATH  Google Scholar 

  17. P. Erdös: Geometrical and set-theoretical properties of subsets of the Hilbert space. Math. Lapok 19 (1968) 255–258 (in Hungarian)

    MATH  Google Scholar 

  18. P. Erdös: Problems and results in chromatic graph theory. In: Proof techniques in graph theory (ed. F. Harary). Academic Press, New York London 1969, pp. 27–35

    Google Scholar 

  19. P. Erdös: Problems and results in combinatorial geometry, Disc. Geometry and Convexity. New York Acad. Sci. 440 (1985) 1–11

    Article  Google Scholar 

  20. P. Erdös, S. Kakutani: On non-denumerable graphs. Bull. Amer. Math. Soc. 49 (1943) 457–461

    Article  MathSciNet  MATH  Google Scholar 

  21. P. Erdös, P. Komjáth: Countable decompositions of IR2 and 1R3. Discrete and Comp. Geometry, 5 (1990) 325–331

    MATH  Google Scholar 

  22. F. Galvin, G. Gruenhage: Plane geometry and the continuum hypothesis. Preprint

    Google Scholar 

  23. G. Gruenhage: Covering properties on X 2 - △W-sets, and compact subsets of ∑-products. Topology and its Applications 17 (1984) 287–304

    Article  MathSciNet  MATH  Google Scholar 

  24. K. Hrbacek, T. Jech: Introduction to set theory. Marcel Dekker, 1984

    MATH  Google Scholar 

  25. T. Jech: Set Theory. Academic Press, 1978

    Google Scholar 

  26. P. Komjáth: Tetrahedron free decomposition of R 3. Bull. London Math. Soc. 23 (1991) 116–120

    Article  MathSciNet  MATH  Google Scholar 

  27. P. Komjáth: A decomposition theorem for R n. To appear

    Google Scholar 

  28. P. Komjáth: A second category set with only first category functions. Proc. Amer. Math. Soc. 112 (1991) 1129–1136

    Article  MathSciNet  MATH  Google Scholar 

  29. K. Kunen: Set Theory. North-Holland, 1980

    MATH  Google Scholar 

  30. K. Kunen: Partitioning Euclidean space. Math. Proc. Camb. Philos. Soc. 102 (1987) 379–383

    Article  MathSciNet  MATH  Google Scholar 

  31. M. Laczkovich: Equidecomposability and discrepancy; a solution of Tarski’s circle-squaring problem. Crelle Journal 404 (1990) 77–117

    Article  MathSciNet  MATH  Google Scholar 

  32. N. Lusin: Sur la décomposition des ensembles. C. R. Acad. Sci. Paris (1934) 1674

    Google Scholar 

  33. S. Mazurkiewicz: Sur un ensemble plan. Comptes Rendus Sci. et Lettres de Varsovie 7 (1914) 322–383

    Google Scholar 

  34. A.W. Miller: Infinite combinatorics and definability. Annals of Pure and Applied Logic 41 (1989) 179–203

    Article  MathSciNet  MATH  Google Scholar 

  35. J. Mycielski: About sets invariant with respect to denumerable changes. Fund. Math. 45 (1958) 296–305

    MathSciNet  MATH  Google Scholar 

  36. W.R. Scott, L.M. Sonneborn: Translations of infinite subsets of a group. Coll. Math. 10 (1963) 217–220

    MathSciNet  MATH  Google Scholar 

  37. W. Sierpiński: Sur un théorème équivalent à l’hypothèse du continu. Bull. Int. Acad. Sci. Cracovie A (1919) 1–3

    Google Scholar 

  38. W. Sierpiński: Sur un problème concernant les ensembles mesurables superficiellement. Fund. Math. 1 (1920) 112–115

    Google Scholar 

  39. W. Sierpiński: Sur une proprieté des ensembles linéaires quelconques. Fund. Math. 23 (1934) 125–134

    MATH  Google Scholar 

  40. W. Sierpiński: Hypothèse du continu. Warszawa, 1934

    Google Scholar 

  41. W. Sierpiński: Sur un problème de M. Steinhaus concernant les ensembles de points sur le plan. Fund. Math. 46 (1958) 191–194

    Google Scholar 

  42. A. Szulkin: R 3 is the union of disjoint circles. Amer. Math. Monthly 90 (1983) 640–641

    Article  MathSciNet  MATH  Google Scholar 

  43. L. Trzeciakiewicz: Remarque sur les translations des ensembles linéaires. Comptes Rendus de la Société des Sciences et des Lettres de Varsovie Cl. III. 25 (1932) 63–65

    Google Scholar 

  44. St. Ulam: Über gewisse Zerlegungen von Mengen. Fund. Math. 20 (1933) 221–223

    Google Scholar 

  45. S. Wagon: The Banach-Tarski Paradox. Cambridge University Press, 1985

    MATH  Google Scholar 

Download references

Authors
  1. Péter Komjáth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, H-1364, Budapest, PF-127, Hungary

    János Pach

  2. Courant Institute, New York University, 251 Mercer Street, New York, NY, 10012, USA

    János Pach

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Komjáth, P. (1993). Set Theoretic Constructions in Euclidean Spaces. In: Pach, J. (eds) New Trends in Discrete and Computational Geometry. Algorithms and Combinatorics, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58043-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-58043-7_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55713-5

  • Online ISBN: 978-3-642-58043-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation