• Record: found
  • Abstract: found
  • Poster: found
Is Open Access

Ultrametric Matrices and the Geometric Inverse M-Matrix Problem

ScienceOpen Posters


This work has been published open access under Creative Commons Attribution License CC BY 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Conditions, terms of use and publishing policy can be found at

0/1-matrix, 0/1-simplex, Stieltjes matrix, ultrametric matrices, M-matrix, n-simplex

Read this article at

      There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.


      We describe the symmetric inverse M-matrix problem from a geometric viewpoint. The central questioninthegeometriccontextis,whichpropertiesthelowerdimensionalfacetsofann-simplex S guarantee that S itself has no obtuse dihedral angles. The simplest but strongest of such properties is regularity of the triangular facets. Slightly weaker is to demand that all triangular facets are strongly isosceles. Even more general but also more involved is to demand ultrametricity of all threedimensional tetrahedral facets of S. As part of our exposition we show that either none, or all so-called vertex Gramians associated with an n-simplex S are ultrametric. As a result, the inverse of an ultrametric matrix is weakly diagonally dominant if and only if this inverse is a Stieltjes matrix. Thus, only one of them needs to be proved in order to obtain both.

      Related collections

      Author and article information



      Comment on this article