Automatic Control and Computer Sciences

, Volume 51, Issue 7, pp 757–769 | Cite as

On Numerical Characteristics of a Simplex and Their Estimates



Let n ∈N, and Q n = [0,1] n let be the n-dimensional unit cube. For a nondegenerate simplex S ⊂ R n , by σ S we denote the homothetic image of with center of homothety in the center of gravity of S and ratio of homothety σ. We apply the following numerical characteristics of a simplex. Denote by ξ(S) the minimal σ > 0 with the property Q n ⊂ σS. By α(S) we denote the minimal σ > 0 such that Q n is contained in a translate of a simplex σS. By d i (S) we mean the ith axial diameter of S, i. e., the maximum length of a segment contained in S and parallel to the ith coordinate axis. We apply the computational formulae for ξ(S), α(S), d i (S) which have been proved by the first author. In the paper we discuss the case SQ n . Let ξ n = min{ξ(S): SQ n }. Earlier the first author formulated the conjecture: if ξ(S) = ξ n , then α(S) = ξ(S). He proved this statement for n = 2 and the case when n + 1 is an Hadamard number, i. e., there exist an Hadamard matrix of order n + 1. The following conjecture is more strong proposition: for each n, there exist γ ≥ 1, not depending on SQ n , such that ξ(S) − α(S) ≤ γ(ξ(S) − ξ n ). By ϰ n we denote the minimal γ with such a property. If n + 1 is an Hadamard number, then the precise value of ϰ n is 1. The existence of ϰ n for other n was unclear. In this paper with the use of computer methods we obtain an equality ϰ2 = \(\frac{{5 + 2\sqrt 5 }}{3}\) = 3.1573... Also we prove the new estimate ξ4\(\frac{{19 + 5\sqrt {13} }}{9}\) = 4.1141..., which improves the earlier result ξ4\(\frac{{13}}{3}\) = 4.33... Our conjecture is that ξ4 is precisely \(\frac{{19 + 5\sqrt {13} }}{9}\). Applying this value in numerical computations we achive the value ϰ4 = \(\frac{{4 + \sqrt {13} }}{5}\) =1.5211... Denote by θ n the minimal norm of interpolation projector onto the space of linear functions of n variables as an operator from C(Q n ) in C(Q n ). It is known that, for each n, ξ n \(\frac{{n + 1}}{2}({\theta _n} - 1) + 1\), and for n = 1, 2,3, 7 here we have an equality. Using computer methods we obtain the result θ 4 =\(\frac{7}{3}\). Hence, the minimal n such that the above inequality has a strong form is equal to 4.


simplex cube coefficient of homothety axial diameter linear interpolation projector norm numerical methods 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Klimov, V.S. and Ukhalov, A.Yu., Reshenie zadach matematicheskogo analiza s ispolzovaniem sistem kompyuternoi matematiki (Solving the Problems of Mathematical Analysis with the Use of Systems of Computer Mathematics), Yaroslavl: Yarosl. Gos. Univ., 2014.Google Scholar
  2. 2.
    Nevskij, M.V., Inequalities for the norms of interpolating projections, Model. Anal. Inform. Sist., 2008, vol. 15, no. 3, pp. 28–37.Google Scholar
  3. 3.
    Nevskij, M.V., On a certain relation for the minimal norm of an interpolational projection, Model. Anal. Inf. Sist., 2009, vol. 16, no. 1, pp. 24–43.Google Scholar
  4. 4.
    Nevskii, M.V., On a property of n-dimensional simplices, Math. Notes, 2010, vol. 87, no. 4, pp. 543–555.MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Nevskii, M.V., On geometric charasteristics of an n-dimensional simplex, Model. Anal. Inform. Sist., 2011, vol. 18, no. 2, pp. 52–64.MathSciNetGoogle Scholar
  6. 6.
    Nevskii, M., Properties of axial diameters of a simplex, Discrete Comput. Geom., 2011, vol. 46, no. 2, pp. 301–312.MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Nevskii, M.V., Geometricheskie otsenki v polinomial’noi interpolyatsii (Geometric Estimates in Polynomial Interpolation), Yaroslavl: Yarosl. Gos. Univ., 2012.Google Scholar
  8. 8.
    Nevskii, M.V., Computation of the longest segment of a given direction in a simplex, Fund. Prikl. Mat., 2013, vol. 18, no. 2, pp. 147–152.Google Scholar
  9. 9.
    Hudelson, M., Klee, V., and Larman, D., Largest j-simplices in d-cubes: Some relatives of the Hadamard maximum determinant problem, Linear Algebra Appl., 1996, vols. 241–243, pp. 519–598.MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Lassak, M., Parallelotopes of maximum volume in a simplex, Discrete Comput. Geom., 1999, vol. 21, pp. 449–462.MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Scott, P.R., Lattices and convex sets in space, Quart. J. Math., 1985, vol. 36, pp. 359–362.MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Scott, P.R., Properties of axial diameters, Bull. Austr. Math. Soc., 1989, vol. 39, pp. 329–333.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Allerton Press, Inc. 2017

Authors and Affiliations

  1. 1.Demidov Yaroslavl State UniversityYaroslavlRussia

Personalised recommendations