The Cayley-Menger determinant is irreducible for n ≥ 3

Author： D’Andrea C.   Sombra M.  

Publisher： Springer Publishing Company

ISSN： 0037-4466

Source： Siberian Mathematical Journal, Vol.46, Iss.1, 2005-01, pp. : 71-76

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An Simple Elementary Proof for the Inequality d n < 3 n

By Feng Bei-ye  

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 3, 2005-08 ,pp. : 455-458

Springer Publishing Company

Access to resources Recommend Favorite

Operator-algebraic superridigity for SL n (), n≥3

By Bekka Bachir  

Inventiones mathematicae, Vol. 169, Iss. 2, 2007-08 ,pp. : 401-425

Springer Publishing Company

Access to resources Recommend Favorite

Defining the Determinant-like Function for m by n Matrices Using the Exterior Algebra

By Abhimanyu Pallavi  

Advances in Applied Clifford Algebras, Vol. 23, Iss. 4, 2013-12 ,pp. : 787-792

Springer Publishing Company

Access to resources Recommend Favorite

A Realization of the Irreducible Representations of S n Corresponding to 2-Row Diagrams in the Space of Square-Free Symmetric Forms

By Nikitin P.  

Journal of Mathematical Sciences, Vol. 129, Iss. 2, 2005-08 ,pp. : 3796-3799

Springer Publishing Company

Access to resources Recommend Favorite

A Polynomial Analogue of the 3n + 1 Problem

By Hicks Kenneth   Mullen Gary L.   Yucas Joseph L.   Zavislak Ryan  

American Mathematical Monthly, Vol. 115, Iss. 7, 2008-08 ,pp. : 615-622

Mathematical Association of America

Access to resources Recommend Favorite