Abstract
Had you asked a layman in the fifties what mathematics was about, he would have thought “of dull uninspiring numbers, of a lifeless mechanism which functions according to laws of inescapable necessity” [1]. Coming from a family of many mathematicians, I learned in my younger days how to refute the widely held opinion that mathematicians are mainly concerned with counting, calculating and computing. Euclid’s famous proof of the existence of infinitely many primes by reductio ad absurdum was the standard example of a “philosophical” argument using no calculation: Assume, for the sake of contradiction, that there were only finitely many primes p 1, p 2,…, p n . Then p 1 p 2 …p n + 1 could not have any prime divisor, which is clearly impossible! I was trained to believe that mathematics, a “gigantic, bold venture of the mind”, was “die Schule des Denkens” (the school of thinking) [2, 3]. For me it had much more to do with infinity, philosophy and puzzles, than with counting or tedious computation.
Willst du ins Unendliche schreiten, Geh im Endlichen nach allen Seiten.
J. W. Goethe
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. Rademacher and O. Toeplitz: The enjoyment of mathematics. Princeton University Press, 1957. (Translated from: Von Zahlen und Figuren: Proben Mathematischen Denkens für Liebhaber der Mathematik. Springer, Berlin 1933)
D. J. Struijk: A concise history of mathematics, 2nd edn. Dover Publ., New York
G. Pólya: Mathematical discovery. John Wiley, New York London 1962. (The German translation is entitled: Die Schule des Denkens)
P. Erdös: The art of counting (selected writings, ed. by J. Spencer). MIT Press, Cambridge, Mass. 1973
D. E. Knuth: The art of computer programming, 2nd edn. Addison-Wesley Publ. Co., Reading, Mass. 1981
F. P. Preparata and M. I. Shamos: Computational geometry. An introduction. Springer, New York 1985
K. Mehlhorn: Data structures and algorithms 3: Multi-dimensional searching and computational geometry. Springer, Berlin Heidelberg 1984
H. Edelsbrunner: Algorithms in combinatorial geometry. Springer, Berlin Heidelberg 1987
L. Fejes Tóth: Lagerungen in der Ebene, auf der Kugel und im Raum (2nd edition), Springer, New York Heidelberg Berlin 1972
L. Fejes Tóth: On the permeability of a circle-layer. Studia Sci. Math. Hung. 1 (1966) 5–10
P. Erdös: On a set of distances of n points. Amer. Math. Monthly 53 (1946) 248–250
J. Beck: On the lattice property of the plane, and some problems of Dirac, Motzkin and Erdös in combinatorial geometry. Combinatorica 3 (1983) 281–297
E. Szemerédi and W. T. Trotter, Jr.: A combinatorial distinction between the Euclidean and projective planes. European J. Combinatorics 4 (1983) 385–394
S. Hart and M. Sharir: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorica 6 (1986) 151–177
V. N. Vapnik and A. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16 (1971) 264–280
D. Haussier and E. Welzl: e-nets and simplex range queries, Discrete Comput. Geom. 2 (1987) 127–151
[ A. Björner, M. Las Vergnas, B. Sturmfels, N. White and G. M. Ziegler: Oriented matroids. Cambridge University Press (to appear)
M. Laczkovich: Equidecomposability and discrepancy: a solution of Tarski’s circle-squaring problem. J. Reine Angew. Math. 404 (1990) 77–117
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pach, J. (1993). Introduction. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-58043-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55713-5
Online ISBN: 978-3-642-58043-7
eBook Packages: Springer Book Archive