Abstract
In this chapter, we briefly review some of the mathematical preliminaries that will be needed throughout the monograph. These include a brief review of the most pertinent concepts and results in the theories of vector spaces, matrices, convexity, and graphs. Proofs of several of these results are included to make this chapter as self-contained as possible.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
D.S. Bernstein, Matrix Mathematics: Theory, Facts and Formulas (Princeton University Press, Princeton, 2009)
N. Biggs, Algebraic Graph Theory (Cambridge University Press, London, 1993)
J.R.S. Blair, B. Peyton, An introduction to chordal graphs and clique trees, in Graph Theory and Sparse Matrix Computation, ed. by J.A. George, J.R. Gilbert, J.W.-H. Liu. IMA Volumes in Mathematics and Its Applications, vol. 56 (Springer, New York, 1993), pp. 1–29
J.A. Bondy, U.S.R. Murty, Graph Theory (Springer, New York, 2008)
G.A. Dirac, On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25, 71–76 (1961)
I. Fáry, On straight line representation of planar graphs. Acta Sci. Math. Szeged 11, 229–233 (1948)
D.R. Fulkerson, O.A. Gross, Incidence matrices and interval graphs. Pac. J. Math. 15, 835–855 (1965)
M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57 (Elsevier, Amsterdam, 2004)
J.-B. Hiriart-Urruty, C. Lemaréchal, Fundamentals of Convex Analysis (Springer, Berlin, 2001)
R.A. Horn, C.R. Johnson, Matrix Analysis (Cambridge University Press, Cambridge, 1985)
R.A. Horn, C.R. Johnson, Topics in Matrix Analysis (Cambridge University Press, Cambridge, 1991)
G. Marsaglia, G.P.H. Styan, When does rank (a+b)= rank a + rank b? Can. Math. Bull. 15, 451–452 (1972)
J.J. Moreau, Décomposition orthogonale d’un espace hilbertien selon deux cônes mutuellement polaires. C. R. Acad. Sci Paris 255, 238–240 (1962)
R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, 1970)
D.J. Rose, R.E. Tarjan, G.S. Leuker, Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266–283 (1976)
R. Schneider, Convex Bodies: The Brunn-Minkowski Theory (Cambridge University Press, Cambridge, 1993)
S. Straszewicz, Uber exponierte punkte abgeschlossener punktmengen. Fundam. Math. 24, 139–143 (1935)
R. Thomas, Lecture notes on topology of Euclidean spaces. Georgia Tech., 1993
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Alfakih, A.Y. (2018). Mathematical Preliminaries. In: Euclidean Distance Matrices and Their Applications in Rigidity Theory. Springer, Cham. https://doi.org/10.1007/978-3-319-97846-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-97846-8_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-97845-1
Online ISBN: 978-3-319-97846-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)