From binary cube triangulations to acute binary simplices

Brandts, Jan; van den Hooff, Jelle; Kuiper, Carlo; Steenkamp, Rik

  • Applications of Mathematics 2012, Publisher: Institute of Mathematics AS CR(Prague), page 31-42

Abstract

top
Cottle’s proof that the minimal number of 0 / 1 -simplices needed to triangulate the unit 4 -cube equals 16 uses a modest amount of computer generated results. In this paper we remove the need for computer aid, using some lemmas that may be useful also in a broader context. One of the 0 / 1 -simplices involved, the so-called antipodal simplex, has acute dihedral angles. We continue with the study of such acute binary simplices and point out their possible relation to the Hadamard determinant problem.

How to cite

top

Brandts, Jan, et al. "From binary cube triangulations to acute binary simplices." Applications of Mathematics 2012. Prague: Institute of Mathematics AS CR, 2012. 31-42. <http://eudml.org/doc/287847>.

@inProceedings{Brandts2012,
abstract = {Cottle’s proof that the minimal number of $0/1$-simplices needed to triangulate the unit $4$-cube equals $16$ uses a modest amount of computer generated results. In this paper we remove the need for computer aid, using some lemmas that may be useful also in a broader context. One of the $0/1$-simplices involved, the so-called antipodal simplex, has acute dihedral angles. We continue with the study of such acute binary simplices and point out their possible relation to the Hadamard determinant problem.},
author = {Brandts, Jan, van den Hooff, Jelle, Kuiper, Carlo, Steenkamp, Rik},
booktitle = {Applications of Mathematics 2012},
keywords = {$0/1$-simplex; acute simplex; Hadamar determinant problem; binary cube triangulations},
location = {Prague},
pages = {31-42},
publisher = {Institute of Mathematics AS CR},
title = {From binary cube triangulations to acute binary simplices},
url = {http://eudml.org/doc/287847},
year = {2012},
}

TY - CLSWK
AU - Brandts, Jan
AU - van den Hooff, Jelle
AU - Kuiper, Carlo
AU - Steenkamp, Rik
TI - From binary cube triangulations to acute binary simplices
T2 - Applications of Mathematics 2012
PY - 2012
CY - Prague
PB - Institute of Mathematics AS CR
SP - 31
EP - 42
AB - Cottle’s proof that the minimal number of $0/1$-simplices needed to triangulate the unit $4$-cube equals $16$ uses a modest amount of computer generated results. In this paper we remove the need for computer aid, using some lemmas that may be useful also in a broader context. One of the $0/1$-simplices involved, the so-called antipodal simplex, has acute dihedral angles. We continue with the study of such acute binary simplices and point out their possible relation to the Hadamard determinant problem.
KW - $0/1$-simplex; acute simplex; Hadamar determinant problem; binary cube triangulations
UR - http://eudml.org/doc/287847
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.