Regular tetrahedra whose vertices have integer coordinates
Acta mathematica Universitatis Comenianae, Tome 80 (2011) no. 2
Citer cet article
Voir la notice de l'article provenant de la source Comenius University
In this paper we introduce theoretical arguments for constructing a procedure that allows one to find the number of all regular tetrahedra that have coordinates in the set {0,1, . . . , n}. The terms of this sequence are twice the values of the sequence A103158 in the Online Encyclopedia of Integer Sequences. These results lead to the consideration of an infinite graph having a fractal nature which is tightly connected to the set of orthogonal 3-by-3 matrices with rational coefficients. The vertices of this graph are the primitive integer solutions of the Diophantine equation a 2 + b 2 + c 2 = 3 d 2 . Our aim here is to laid down the basis of finding good estimates, if not exact formulae, for the sequence A103158.