Proving a Special Case of the Coxeter-Hadwiger Conjecture

Abstract

An orthoscheme or Pythagorean simplex is a solid in n-dimensional Euclidean space whose faces are right triangles. In 1956, Hadwiger asked whether an n-dimensional general (not necessarily Pythagorean) simplex can always be decomposed into a finite number of Pythagorean simplexes. Tschirpke proved in 1994 that this division is always possible in 5D space. Coxeter proved that a 3D Pythagorean simplex can be split into three smaller ones. In a 2024 paper, I generalized Coxeter’s trisection to prove that the dissection of an n-dimensional Pythagorean simplex into n pieces of the same type is possible if each leg of the original solid is equal to the unit distance. In the present paper, I extend this proof to an n-dimensional Pythagorean simplex with legs of arbitrary measure. This means the proof of the Hadwiger conjecture in the special case of a Pythagorean simplex.

Share and Cite:

Lénárt, I. (2025) Proving a Special Case of the Coxeter-Hadwiger Conjecture. Journal of Applied Mathematics and Physics, 13, 2700-2711. doi: 10.4236/jamp.2025.138154.

1. Pythagorean Simplexes in n-Dimensional Euclidean Spaces

This article is an extension of [1]. I try to make it understandable in itself, but I ask the Reader to consult the previous article for preliminary details, which I do not wish to repeat in full here.

1.1. Definition of a Pythagorean Simplex

The literature on n-dimensional geometry usually treats the general triangle as the 2D simplex and the general tetrahedron as the 3D simplex. Since the mid-19th century, however, researchers have recognized the importance of the 2D right triangle and the 3D quadrirectangular tetrahedron as possible alternatives to the definition of the simplex in the respective dimensions [2].

Definition. Consider an ordered chain of straight line segments a 1 , a 2 ,, a n in an n-dimensional Euclidean space where the starting point of segment a i ( i>1 ) coincides with the endpoint of segment a i1 , and segment a i is perpendicular to the (i − 1)-dimensional space formed by the preceding segments a 1 , a 2 ,, a i1 . Tschirpke calls this series of segments a totally orthogonal edge path [3].

Define segments a 1 , a 2 ,, a n the legs (catheti) of the solid, and segment a n+1 the hypotenuse connecting the endpoint of segment a n with the starting point of segment a 1 .

The extension of the Pythagorean Theorem applies for this n-dimensional shape, namely, for the hypotenuse, a n+1 2 = a 1 2 + a 2 2 ++ a n 2 = 1 n a i 2 , and for the volume, V= 1 n! a 1 a 2 a 3 a n = 1 n a i n! .

The n-dimensional hypotenuse formula is a direct generalization of the 2D Pythagorean Theorem.

The volume formula can be deduced from the Cayley-Menger determinant which uses the edges of a tetrahedron to calculate its volume. I demonstrate the method for a 3D Pythagorean tetrahedron each face of which is a right triangle (Figure 1). Let us denote the length of the three legs as a,b,c , then the Cayley-Menger determinant gives the following result:

| D 3,CM |= 2 3 ( 3! ) 2 ( 1 ) 3+1 V 2 =| 0 1 1 1 1 1 0 a 2 a 2 + b 2 a 2 + b 2 + c 2 1 a 2 0 b 2 b 2 + c 2 1 a 2 + b 2 b 2 0 c 2 1 a 2 + b 2 + c 2 b 2 + c 2 c 2 0 | =| 1 a 2 a 2 + b 2 a 2 + b 2 + c 2 1 0 b 2 b 2 + c 2 1 b 2 0 c 2 1 b 2 + c 2 c 2 0 |+| 1 0 a 2 + b 2 a 2 + b 2 + c 2 1 a 2 b 2 b 2 + c 2 1 a 2 + b 2 0 c 2 1 a 2 + b 2 + c 2 c 2 0 | | 1 0 a 2 a 2 + b 2 + c 2 1 a 2 0 b 2 + c 2 1 a 2 + b 2 b 2 c 2 1 a 2 + b 2 + c 2 b 2 + c 2 0 |+| 1 0 a 2 a 2 + b 2 1 a 2 0 b 2 1 a 2 + b 2 b 2 0 1 a 2 + b 2 + c 2 b 2 + c 2 c 2 | =4 a 2 b 2 c 2 +4 a 2 b 2 c 2 +0+0= 2 3 a 2 b 2 c 2

V= 1 3! abc

This formula can be directly generalized using the Cayley-Menger determinant in higher dimensions. For example, a 4D simplex of this type with legs a,b,c,d has volume V= 1 4! abcd .

These hypotenuse and volume formulas play a key role in the following proofs.

The n-dimensional shape has been called by various names, such as a pyramid, an ortoscheme, Orthogonalsimplex, or in the 3D case, a quadrirectangular tetrahedron.

I propose the name a Pythagorean n-simplex for the n-dimensional shape with n legs and one hypotenuse.

In this paper, I shorten this name to a Pyth simplex, as for example, a Pyth triangle (right triangle), Pyth tetrahedron (quadrirectangular tetrahedron), Pyth pentachoron, etc.

1.2. Representing Multidimensional Objects

Several methods have been developed to visualize multidimensional objects on the flat sheet (see for example [3] or [4]).

The traditional right angle symbols seemed confusing to me in the drawings, so I chose a different marking method. A right angle is denoted here as an arc in the angle region terminating with two dots on the corresponding sides, regardless of the apparent length of the arc or the apparent position of the lines in the drawing. Figure 1 shows the picture of a 3D model of a Pyth tetrahedron, while Figure 2 displays the representation of the same model in this article.

Figure 1. A Pythagorean tetrahedron, every face of which is a right triangle.

Figure 2. A Pythagorean tetrahedron displayed in this article (see explanation of marking below).

The points of intersection that really exist in the n-dimensional solid are only those which are marked with letters/numbers in the figure (as in graph theory). Lines that intersect in the flat figure without marking the point of intersection are skew lines, as A 1 A 3 and A 2 A 4 in Figure 2.

To better understand the essence of the geometric structure, the actual length of the segment and the measure of the angle are distorted in most of the drawings. Therefore, I ask the Reader to rely on the notation and legend of the lines and angles, rather than the apparent position of the visual image.

1.3. Distribution of Right Angles in a Pyth n-Simplex

As seen in Figure 2 or Figure 3, if we specify the length of the legs and the location of right angles in the simplex, the length of all other sides can be calculated. The recursive formula for the number of right triangles in an n-dimensional Pyth simplex is: s n = s n1 + ( n1 )n 2 , ( n2 , s 1 =0 ).

Figure 3. Pyth simplex in 4D.

2. The Coxeter Partition as a Tool to Prove a Special Case of the Hadwiger Conjecture

Coxeter proved that a 3D Pythagorean simplex (Pyth tetrahedron) can be cut into three smaller 3D Pyth simplexes [5].

Hadwiger proposed the conjecture in 1956 that any n-dimensional general simplex can be decomposed into a finite number of Pyth simplexes of the same dimension [6]. Tschirpke proved this conjecture to 5D in 1994 [4].

In what follows, I use the generalization of the Coxeter trisection to prove a special case of the Hadwiger conjecture, namely, the partition of an n-dimensional Pyth simplex into n pieces of smaller Pyth simplexes of the same dimension.

It is of course possible that other types of partitions also exist, and the conjecture can be proven through other partitions.

2.1. The Coxeter Partition in 2D Space: A 2D Simplex Partitioned in Two 2D Simplexes

Consider a Pyth triangle ( A 1 A 2 A 3 ) . Drop a perpendicular from vertex A 2 to side ( A 1 A 3 ) , mark the foot B 1 , and get two smaller triangles ( A 2 B 1 A 1 ) and ( A 2 B 1 A 3 ) (Figure 4).

Figure 4. Coxeter partition in 2D.

The volumes of the two smaller Pyth 2D simplexes (Pyth triangles) add up to the volume of the original Pyth triangle:

V 1 ( A 2 B 1 A 1 )+ V 2 ( A 2 B 1 A 3 )= 1 2! a 2 a 2 + b 2 ab a 2 + b 2 + 1 2! b 2 a 2 + b 2 ab a 2 + b 2 = 1 2! ab a 2 + b 2 a 2 + b 2 = 1 2! ab=V( A 2 A 3 A 1 )

This result completes the proof of the Coxeter partition for a Pyth simplex in 2D space.

Remark: In what follows, I will make frequent use of the fact that the non-trivial altitude of a 2D right triangle with legs a,b is equal to ab a 2 + b 2 , and the hypotenuse is divided by the foot into two segments a 2 a 2 + b 2 and b 2 a 2 + b 2 respectively.

2.2. The Coxeter Partition in 3D Space: A 3D Simplex Partitioned in Three 3D Simplexes

Consider a Pyth tetrahedron ( A 1 A 2 A 3 A 4 ) . Drop a perpendicular from vertex A 2 to edge ( A 1 A 3 ) , mark the foot B 1 . Erect a perpendicular from B 1 to edge ( A 1 A 4 ) , mark the foot B 2 . Connect B 2 and A 2 , and get a tetrahedron ( A 2 B 1 B 2 A 1 ) . Connect B 1 and A 4 , and get two further tetrahedra ( A 2 B 1 B 2 A 4 ) and ( A 2 B 1 A 3 A 4 ) (Figure 5 and Figure 6).

Figure 5. A 3D model of the Coxeter partition of a 3D Pyth tetrahedron.

Figure 6. Flat sheet representation of the Coxeter partition of a 3D Pyth tetrahedron.

The triangle ( A 2 B 1 B 2 ) is a right triangle with the right angle at vertex ( B 1 ) , because the plane ( A 1 A 3 A 4 ) is perpendicular to the plane ( A 1 A 2 A 4 ) in the original Pyth tetrahedron ( A 1 A 2 A 3 A 4 ) . Therefore, the line ( A 2 B 1 ) in the plane ( A 1 A 2 A 4 ) is perpendicular to the lines ( B 1 B 2 ),( B 1 A 4 ) in the plane ( A 1 A 3 A 4 ) . This gives that the three smaller tetrahedra ( A 2 B 1 B 2 A 1 ),( A 2 B 1 B 2 A 4 ),( A 2 B 1 A 3 A 4 ) are also Pyth 3D simplexes, because each face is a right triangle.

There are 12 right triangles in Figure 6, namely,

( A 1 A 2 A 3 ),( A 2 A 3 A 4 ),( A 1 A 2 A 4 ),( A 1 A 3 A 4 ),( A 1 B 1 A 2 ),( A 2 B 1 A 3 ), ( A 2 B 1 B 2 ),( A 2 B 1 A 4 ),( A 1 B 2 A 2 ),( A 1 B 2 B 1 ),( A 2 B 2 A 4 ),( B 1 B 2 A 4 ),

with the right angle vertex at the middle in each triplet.

Let ( A 1 A 2 )=a,( A 2 A 3 )=b,( A 3 A 4 )=c,( A 1 A 4 )= a 2 + b 2 + c 2 ,

then ( A 2 B 1 )= ab a 2 + b 2 , because ( A 2 B 1 ) is the non-trivial altitude of right triangle ( A 1 A 2 A 3 ) ;

( A 2 B 2 )= a b 2 + c 2 a 2 + b 2 + c 2 , because ( A 2 B 2 ) is the non-trivial altitude of right triangle ( A 1 A 2 A 4 ) ;

( B 1 B 2 ) 2 = ( A 2 B 2 ) 2 ( A 2 B 1 ) 2 = a 2 ( b 2 + c 2 ) a 2 + b 2 + c 2 a 2 b 2 a 2 + b 2 = a 4 c 2 ( a 2 + b 2 )( a 2 + b 2 + c 2 ) , because ( B 1 B 2 ) is a leg of right triangle ( A 2 B 1 B 2 ) ;

( A 1 B 2 ) 2 = ( A 1 A 2 ) 2 ( A 2 B 2 ) 2 = a 2 a 2 ( b 2 + c 2 ) a 2 + b 2 + c 2 = a 4 a 2 + b 2 + c 2 , because ( A 1 B 2 ) is a leg of right triangle ( A 1 B 2 A 2 ) ;

( B 2 A 4 )=( A 1 A 4 )( A 1 B 2 )= a 2 + b 2 + c 2 a 2 a 2 + b 2 + c 2 = b 2 + c 2 a 2 + b 2 + c 2 .

The volumes of the three smaller Pyth 3D simplexes (Pyth tetrahedra) add up to the volume of the original Pyth simplex:

V 1 ( A 2 B 1 B 2 A 1 )+ V 2 ( A 2 B 1 B 2 A 4 )+ V 3 ( A 2 B 1 A 3 A 4 ) = 1 3! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 a 2 a 2 + b 2 + c 2 + 1 3! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 b 2 + c 2 a 2 + b 2 + c 2 + 1 3! ab a 2 + b 2 b 2 a 2 + b 2 c = 1 3! a 5 bc ( a 2 + b 2 )( a 2 + b 2 + c 2 ) + 1 3! a 3 bc( b 2 + c 2 ) ( a 2 + b 2 )( a 2 + b 2 + c 2 ) + 1 3! a b 3 c a 2 + b 2 = 1 3! abc b 2 ( a 2 + b 2 + c 2 )+ a 4 +( b 2 + c 2 ) a 2 ( a 2 + b 2 )( a 2 + b 2 + c 2 ) = 1 3! abc a 4 + a 2 ( b 2 + c 2 )+ b 2 ( a 2 + b 2 + c 2 ) ( a 2 + b 2 )( a 2 + b 2 + c 2 ) = 1 3! abc ( a 2 + b 2 )( a 2 + b 2 + c 2 ) ( a 2 + b 2 )( a 2 + b 2 + c 2 ) = 1 3! abc=V( A 2 A 3 A 4 A 1 )

This result completes the proof of the Coxeter partition for a Pyth simplex in 3D space.

2.3. The Coxeter Partition in 4D Space: A 4D Simplex Partitioned in Four 4D Simplexes

For clarity, Figure 7 only indicates the right angles that are necessary for the proof.

Figure 7. Coxeter partition in 4D.

The volumes of the four smaller Pyth 4D simplexes (Pyth pentachorons) add up to the volume of the original Pyth 4D simplex:

V 1 ( A 2 B 1 B 2 B 3 A 1 )+ V 2 ( A 2 B 1 B 2 B 3 A 5 )+ V 3 ( A 2 B 1 B 2 A 4 A 5 )+ V 4 ( A 2 B 1 A 3 A 4 A 5 ) = 1 4! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 a 2 d a 2 + b 2 + c 2 a 2 a 2 + b 2 + c 2 + d 2 + 1 4! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 a 2 d a 2 + b 2 + c 2 b 2 + c 2 + d 2 a 2 + b 2 + c 2 + d 2 + 1 4! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 b 2 + c 2 a 2 + b 2 + c 2 d+ 1 4! ab a 2 + b 2 b 2 a 2 + b 2 cd = 1 4! abcd a 6 + a 4 ( b 2 + c 2 + d 2 )+ a 2 ( b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 )+ b 2 ( a 2 + b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 ) ( a 2 + b 2 )( a 2 + b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 ) = 1 4! abcd ( a 2 + b 2 )( a 2 + b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 ) ( a 2 + b 2 )( a 2 + b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 ) = 1 4! abcd=V( A 2 A 3 A 4 A 5 A 1 )

This result completes the proof of the Coxeter partition for a Pyth simplex in 4D space.

2.4. The Coxeter Partition in 5D Space: A 5D Simplex Partitioned in Five 5D Simplexes

For clarity, Figure 8 only indicates the right angles that are necessary for the proof.

The volumes of the five smaller Pyth 5D simplexes add up to the volume of the original 5D Pyth simplex:

V 1 ( A 2 B 1 B 2 B 3 B 4 A 1 )+ V 2 ( A 2 B 1 B 2 B 3 B 4 A 6 )+ V 3 ( A 2 B 1 B 2 B 3 A 5 A 6 ) + V 4 ( A 2 B 1 B 2 A 4 A 5 A 6 )+ V 5 ( A 2 B 1 A 3 A 4 A 5 A 6 ) = 1 5! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 a 2 d a 2 + b 2 + c 2 a 2 + b 2 + c 2 + d 2 × a 2 e a 2 + b 2 + c 2 + d 2 a 2 + b 2 + c 2 + d 2 + e 2 a 2 a 2 + b 2 + c 2 + d 2 + e 2 + 1 5! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 a 2 d a 2 + b 2 + c 2 a 2 + b 2 + c 2 + d 2 × a 2 e a 2 + b 2 + c 2 + d 2 a 2 + b 2 + c 2 + d 2 + e 2 b 2 + c 2 + d 2 + e 2 a 2 + b 2 + c 2 + d 2 + e 2 + 1 5! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 a 2 d a 2 + b 2 + c 2 a 2 + b 2 + c 2 + d 2 × b 2 + c 2 + d 2 a 2 + b 2 + c 2 a 2 + b 2 + c 2 + d 2 e + 1 5! ab a 2 + b 2 a 2 c a 2 + b 2 a 2 + b 2 + c 2 b 2 + c 2 a 2 + b 2 + c 2 de + 1 5! ab a 2 + b 2 b 2 a 2 + b 2 cde = 1 5! abcde A+B C

A= a 8 + a 6 ( b 2 + c 2 + d 2 + e 2 )+ a 4 ( b 2 + c 2 + d 2 )( a 2 + b 2 + c 2 + d 2 + e 2 ) + a 2 ( b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 )( a 2 + b 2 + c 2 + d 2 + e 2 )

B= b 2 ( a 2 + b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 )( a 2 + b 2 + c 2 + d 2 + e 2 )

C=( a 2 + b 2 )( a 2 + b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 )( a 2 + b 2 + c 2 + d 2 + e 2 )

= 1 5! abcde ( a 2 + b 2 )( a 2 + b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 ) ( a 2 + b 2 )( a 2 + b 2 + c 2 )( a 2 + b 2 + c 2 + d 2 ) = 1 5! abcde=V( A 2 A 3 A 4 A 5 A 6 A 1 )

Figure 8. Coxeter partition in 5D.

This result completes the proof of the Coxeter partition of a Pyth simplex in 5D space.

To construct a 6D Pyth simplex, add the triangle ( A 1 A 6 A 7 ) to side ( A 1 A 6 ) of the 5D Pyth simplex in Figure 8, and mark a new partition point B 5 on side ( A 1 A 6 ) .

The respective measures of segments:

( A 6 A 7 )=f ;

( A 1 B 5 )= a 2 a 2 + b 2 + c 2 + d 2 + e 2 + f 2 ;

( B 5 A 7 )= b 2 + c 2 + d 2 + e 2 + f 2 a 2 + b 2 + c 2 + d 2 + e 2 + f 2 ;

( B 5 B 6 )= a 2 f a 2 + b 2 + c 2 + d 2 + e 2 a 2 + b 2 + c 2 + d 2 + e 2 + f 2 .

The volume calculations can be made using the pattern of the previous cases (see also Chapter 3 below).

3. Generalization to n-Dimensional Space: An n-Dimensional Pyth Simplex Partitioned in n Pyth Simplexes

The Principle of Recursion for the n-Dimensional Pyth Simplex

Suppose that the Coxeter partition is settled for the (n-1)-dimensional simplex A 1 A 2 A 3 A n1 A n .with partition points B 1 , B 2 , B 3 , B n3 B n2 .

In the n-dimensional space, triangle ( A 1 A n A n+1 ) is added to side ( A 1 A n ) of the (n − 1)D Pyth simplex (Figure 9). Mark a new partition point B n1 as the foot of the perpendicular dropped from point B n2 onto side ( A 1 A n+1 ) .

Figure 9. Coxeter partition in (n)D.

Consider the Pyth simplex with vertices A 1 A 2 A 3 A n1 A n A n+1 , and sides a 1 a 2 a 3 a n1 a n . The partitioning of this Pyth simplex with partition points B 1 , B 2 , B 3 , B n2 B n1 can be carried out by applying the algorithm in the previous cases (Table 1).

Table 1. Vertices of the n Pyth simplexes of the Coxeter division of the original (n)D Pyth simplex.

Simplex 1

A 2

B 1

B 2

B 3

B 4

B n3

B n2

B n1

A 1

Simplex 2

A 2

B 1

B 2

B 3

B 4

B n3

B n2

B n1

A n+1

Simplex 3

A 2

B 1

B 2

B 3

B 4

B n3

B n2

A n

A n+1

Simplex 4

A 2

B 1

B 2

B 3

B 4

B n3

A n1

A n

A n+1

Simplex (n − 2)

A 2

B 1

B 2

B 3

A 5

A n2

A n1

A n

A n+1

Simplex (n − 1)

A 2

B 1

B 2

A 4

A 5

A n2

A n1

A n

A n+1

Simplex (n)

A 2

B 1

A 3

A 4

A 5

A n2

A n1

A n

A n+1

The respective measures of segments in triangle ( A 1 A n A n+1 ) :

( A n A n+1 )= a n ;

( A 1 B n2 )= a 1 2 a 1 2 + a 2 2 ++ a n1 2 + a n 2 ;

( B n2 A n )= a 2 2 + a 3 2 ++ a n1 2 + a n 2 a 1 2 + a 2 2 ++ a n1 2 + a n 2 ;

( B n2 B n1 )= a 1 2 a n a 1 2 + a 2 2 ++ a n1 2 a 1 2 + a 2 2 ++ a n1 2 + a n 2 .

The calculation of the volumes of n pieces of (n)-dimensional Pyth simplexes can be done by using the divisions in Table 1.

4. Conclusions and Background

The starting idea of the article comes from spherical geometry. If point P is on line l, then the polar p of point P is perpendicular to line e. This means that the incidence of a point and a straight line is equivalent to the perpendicularity of two straight lines. In this interpretation, a general triangle is a 6-cycle of incidence of vertices and sides V 1 s 1 V 2 s 2 V 3 s 3 , but a right triangle can be interpreted as a 5-cycle of vertices and sides V 1 s 1 V 2 V 3 s 3 , where sides V 2 , V 3 are perpendicular to each other. In this sense, a right triangle is not a special case of a general triangle, but conversely, the general triangle is a composite shape formed from right triangles.

I tried to apply this approach in 2D spherical, hyperbolic and plane geometry [7], and in higher-dimensional Euclidean geometry [8]. I proposed the right triangle, the Lambert quadrilateral, the spherical Napier pentagram, and the hyperbolic Napier pentagon as simplexes in 2D geometries, and the Pythagorean solids as simplexes in multidimensional Euclidean geometry. I used the Coxeter trisection to show that moving from general simplexes to Pythagorean simplexes as basic building blocks of multidimensional geometry leads to thought-provoking questions and reasonable answers. Only later did I become acquainted with Hadwiger’s conjecture and Tschirpke’s results in this field, which were based on graph theory and classification of dihedral angles, quite different from my own reasoning.

Clearly, the proofs in the present article apply only to the Pythagorean subset of general simplexes. However, I hope that Pythagorean simplexes will prove to be a useful tool for asking pertinent questions and solving certain problems in multidimensional geometry.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Lénárt, I. (2024) The Coxeter Trisection and the Hadwiger Conjecture in Multidimensional Spaces. Journal of Applied Mathematics and Physics, 12, 4301-4321.[CrossRef]
[2] Schläfli, L. (1901) Theorie der vielfachen Kontinuität. Cornell University Library Historical Math Monographs 2010 (in German), 10-22.
[3] Tschirpke, K. (1994) The Dissection of Five-Dimensional Simplexes into Orthoschemes. Beiträge zur Algebra und Geometrie, 35, 1-11.
[4] Petrie, J.F. (1938) Petrie Polygons. In: Coxeter, H.S.M., du Val, P., Flather, H.T., Petrie, J.F., Eds., The Fifty-Nine Icosahedra, University of Toronto Studies, Mathematical Series, 1-26.
[5] Coxeter, H.S.M. (1989) Trisecting an Orthoscheme. Computers & Mathematics with Applications, 17, 59-71.[CrossRef]
[6] Hadwiger, H. (1956) Ungelöste Probleme. Elemente der Mathematik, 11, 109-110.
[7] Lénárt, I. (2020) The Algebra of Projective Spheres on Plane, Sphere and Hemisphere. Journal of Applied Mathematics and Physics, 8, 2286-2333.[CrossRef]
[8] Lénárt, I. (2022) The Right Triangle as the Simplex in 2D Euclidean Space, Generalized to n Dimensions. Journal of Applied Mathematics and Physics, 10, 2837-2850.[CrossRef]

Copyright © 2026 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.