The Theory of Determinants
By T. B.
THIS well known treatise has been revised and enlarged in several respects. For instance (chapter xi.), the theory of linear equations is more complete than in the first edition, and Bezout's method of elimination is explained, as well as Sylvester's.The Theory of Determinants.By R. F. Scott Second edition. Revised by G. B. Mathews, M.A., F.R.S. Pp. xi + 288. (Cambridge: University Press, 1904.) Price 9s. net.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Alex Kulesza
- B. Taskar
- R. Thomas
- Oliver Knill
- Igor Dolgachev
- Yoshua Bengio
- Nathan D. Ratliff
- Tamir Hazan
Citations in the corpus
- Determinantal Point Processes for Machine Learning (2012, background): “Hyperdeterminantal point processes A third possible generalization of Equation (82) is the hyperdeterminant originally proposed by Cayley [1843] and discussed in the context of point processes by Evans and Gottlieb [2009].”
- Two closed forms for the Bernoulli polynomials (2015, unknown): “Bn = (−1)n−1 (n + 1)! ∣∣∣∣∣∣∣∣∣ 1 2 0 0 · · · 0 1 3 3 0 · · · 0 1 4 6 4 · · · 0 1 5 10 10 · · · 0 · · · · · · · · · · · · · · · · · · ( n+1 0 ) ( n+1 1 ) ( n+1 2 ) ( n+1 3 ) · · · ( n+1 n−1 ) ∣∣∣∣∣∣∣∣∣ was traced back to the book [36].”
- A survey of Pfaffian orientations of graphs (2006, background): “We will need the following lemma from linear algebra [23], [37].”
- Cauchy-Binet for Pseudo-Determinants (2013, background): “It was Cayley who looked first at the matrix algebra [13, 26, 34].”
- Classical Algebraic Geometry: A Modern View (2012, background): “81) whose symbolic expression is (12)(2)(13)(24)(34)(2) (see [581], p.”