How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? (Q2632013)

The article counts how many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube. It turns out that the number of triangles is equal to \(2^{n} (n-1)\) (for \(n=3,4,5,\ldots )\), and the number of quadrilaterals is equal to \(2^{n-2} (2n^{2} +5n-11)\) (for \(n=3,4,5,\ldots \)). The authors argue that the results indicate the prospects for the use of transmission network designs based on an \(n\)-dimensional augmented cube. The reviewer believes that this is obvious without the obtained formulas, but the design and construction of such networks is a very complex technical, not mathematical problem.