Counting triangles that share their vertices with the unit n-cube.

DOI10.1016/J.LAA.2016.05.015zbMATH Open1382.15047arXiv1512.02940OpenAlexW2298126356MaRDI QIDQ739092FDOQ739092

Authors: Apo Cihangir, J. H. Brandts 

Publication date: 17 August 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We investigate the symmetric inverse M-matrix problem from a geometric perspective. The central question in this geometric context is, which conditions on the k-dimensional facets of an n-simplex S guarantee that S has no obtuse dihedral angles. First we study the properties of an n-simplex S whose k-facets are all nonobtuse, and generalize some classical results by Fiedler. We prove that if all (n-1)-facets of an n-simplex S are nonobtuse, each makes at most one obtuse dihedral angle with another facet. This helps to identify a special type of tetrahedron, which we will call sub-orthocentric, with the property that if all tetrahedral facets of S are sub-orthocentric, then S is nonobtuse. Rephrased in the language of linear algebra, this constitutes a purely geometric proof of the fact that each symmetric ultrametric matrix is the inverse of a weakly diagonally dominant M-matrix. Review papers support our belief that the linear algebraic perspective on the inverse M-matrix problem dominates the literature. The geometric perspective however connects sign properties of entries of inverses of a symmetric positive definite matrix to the dihedral angle properties of an underlying simplex, and enables an explicit visualization of how these angles and signs can be manipulated. This will serve to formulate purely geometric conditions on the k-facets of an n-simplex S that may render S nonobtuse also for k>3. For this, we generalize the class of sub-orthocentric tetrahedra that gives rise to the class of ultrametric matrices, to sub-orthocentric simplices that define symmetric positive definite matrices A with special types of k x k principal submatrices for k>3. Each sub-orthocentric simplices is nonobtuse, and we conjecture that any simplex with sub-orthocentric facets only, is sub-orthocentric itself.

Full work available at URL: https://arxiv.org/abs/1512.02940

Recommendations

• There are only two nonobtuse binary triangulations of the unit \(n\)-cube
• Regular octahedra in \(\{0,1,\dots,n\}^3\)
• On triangulations of the surface of a cube into planar acute triangles
• Counting all equilateral triangles in \(\{0,1,\dots ,n\}^3\)
• Enumeration and investigation of acute \(0/1\)-simplices modulo the action of the hyperoctahedral group

zbMATH Keywords

completely positive matrixdoubly nonnegative matrix\(0/1\)-equivalence\(0/1\)-polytopenonobtuse simplex\(0/1\)-triangledual hullinverse M-matrixsub-orthocentric setsub-orthocentric simplexultrametric matrixvertex Gramian

Mathematics Subject Classification ID

Factorization of matrices (15A23) Exact enumeration problems, generating functions (05A15) Positive matrices and their generalizations; cones of matrices (15B48) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Matrices of integers (15B36) Congruence and orthogonality in metric geometry (51F20)

Cites Work

• Title not available (Why is that?)
• Matrices and graphs in geometry
• Title not available (Why is that?)
• On classes of inverse \(Z\)-matrices
• Inverse \(M\)-matrices and ultrametric matrices
• Inverse of Strictly Ultrametric Matrices are of Stieltjes Type
• Title not available (Why is that?)
• Finite elements. Theory, fast solvers, and applications in solid mechanics. Transl. from the German by Larry L. Schumaker.
• Title not available (Why is that?)
• On Nonobtuse Simplicial Partitions
• Title not available (Why is that?)
• The discrete maximum principle for linear simplicial finite element approximations of a reaction-diffusion problem
• Title not available (Why is that?)
• Gradient superconvergence on uniform simplicial partitions of polytopes
• Inverse M-matrices
• On qualitative angle properties of simplexes
• Dissection of the path-simplex in \(\mathbb {R}^n\) into \(n\) path-subsimplices
• A Linear Algebra Proof that the Inverse of a Strictly Ultrametric Matrix is a Strictly Diagonally Dominant Stieltjes Matrix
• The inverse M-matrix problem
• Special ultrametric matrices and graphs
• Ultrametric sets in Euclidean point spaces
• Nonnegative Matrices whose Inverses are M-Matrices
• Inverse \(M\)-matrices. II
• Title not available (Why is that?)
• Altitudes of a Tetrahedron and Traceless Quadratic Forms
• Notes on the Orthocentric Tetrahedron
• Title not available (Why is that?)
• The Semi-Orthocentric Tetrahedron

Cited In (3)

• On the construction of trivariate near-best quasi-interpolants based on \(C^2\) quartic splines on type-6 tetrahedral partitions
• Title not available (Why is that?)
• Inverse \(M\)-matrix, a new characterization

This page was built for publication: Counting triangles that share their vertices with the unit \(n\)-cube.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q739092)