# New Estimates of Numerical Values Related to a Simplex

- 10 Downloads

## Abstract

Let *n* ∈N, and let *Q*_{ n } = [0 1]^{ n }. For a nondegenerate simplex *S* ⊂ R^{ n }, by σ*S* we denote the homothetic copy of *S* with center of homothety in the center of gravity of *S* and ratio of homothety σ. By ξ(*S*) we mean the minimal σ > 0 such that *Q*_{ n } ⊂ σ*S*. By α(*S*) let us denote the minimal σ > 0 such that *Q*_{ n } is contained in a translate of σ*S*. By *d*_{ i }(*S*) we denote the *i*th axial diameter of *S*, i. e. the maximum length of the segment contained in *S* and parallel to the *i*th coordinate axis. Formulae for ξ(*S*), α(*S*), *d*_{ i }(*S*) were proved earlier by the first author. Define ξ_{ n } = min{ξ(*S*): *S* ⊂ *Q*_{ n }}. Always we have ξ_{ n } ≥ *n*. We discuss some conjectures formulated in the previous papers. One of these conjectures is the following. For every *n*, there exists γ > 0, not depending on *S* ⊂ *Q*_{ n }, such that an inequality ξ(*S*) − α(*S*) ≤ γ(ξ(*S*) − ξ_{ n }) holds. Denote by **ϰ**_{ n } the minimal γ with such a property. We prove that **ϰ**_{1} = \(\frac{1}{2}\); for *n* > 1, we obtain **ϰ**_{ n } ≥ 1. If *n* > 1 and ξ_{ n } = *n*, then **ϰ**_{ n } = 1. The equality holds ξ_{ n } = *n* if *n* + 1is an Hadamard number, i. e. there exists an Hadamard matrix of order *n* + 1. This proposition is known; we give one more proof with the direct use of Hadamard matrices. We prove that ξ_{ 5 } = *5*. Therefore, there exist *n* such that *n* + 1 is not an Hadamard number and nevertheless ξ_{ n } = *n*. The minimal *n* with such a property is equal to 5. This involves **ϰ**_{ 5 } = 1 and also disproves the following previous conjecture of the first author concerning the characterization of Hadamard numbers in terms of homothety of simplices: *n* + 1 is an Hadamard number if and only if ξ_{ n } = *n*. This statement is valid only in one direction. There *S* ⊂ *Q*_{5} exists simplex such that the boundary of the simplex 5*S* contains all the vertices of the cube *Q*_{5}. We describe one-parameter family of simplices contained in *Q*_{5} with the property α(*S*) = ξ(*S*) = 5. These simplices were found with the use of numerical and symbolic computations. Another new result is an inequality ξ_{6} < 6.0166. We also systematize some of our estimates of numbers ξ_{ n }, θ_{ n }, **ϰ**_{ n } provided by the present day. The symbol θ_{ n } denotes the minimal norm of interpolation projector on the space of linear functions of *n* variables as an operator from *C*(*Q*_{ n }) to *C*(*Q*_{ n }).

## Keywords

simplex cube homothety axial diameter interpolation projector numerical methods## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Klimov, V.S., and Ukhalov, A.Yu.,
*Reshenie zadach matematicheskogo analiza s ispol’zovaniem sistem komp’uternoi matematiki*(Solving the Problems of Mathematical Analysis with the Use of Systems of Computer Mathematics), Yaroslavl: Yarosl. Gos. Univ., 2014.Google Scholar - 2.Nevskij, M.V., Inequalities for the norms of interpolating projections,
*Model. Anal. Inf. Sist.*, 2008, vol. 15, no. 3, pp. 28–37.Google Scholar - 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.Nevskii, M.V. On a property of n-dimensional simplices,
*Math. Notes*, 2010, vol. 87, no. 4, pp. 543–555.MathSciNetCrossRefMATHGoogle Scholar - 5.Nevskii, M.V., On geometric characteristics of an n-dimensional simplex,
*Model. Anal. Inf. Sist.*, 2011, vol. 18, no. 2, pp. 52–64.MathSciNetGoogle Scholar - 6.Nevskii, M.V.,
*Geometricheskie otsenki v polinomial’noi interpolyatsii*(Geometric Estimates in Polynomial Interpolation), Yaroslavl: Yarosl. Gos. Univ., 2012.Google Scholar - 7.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 - 8.Nevskii, M.V., and Ukhalov, A.Yu., On numerical characteristics of a simplex and their estimates,
*Model. Anal. Inf. Sist.*, 2016, vol. 23, no. 5, pp. 603–619.MathSciNetCrossRefGoogle Scholar - 9.Hall, M., Jr.,
*Combinatorial Theory*, Waltham (Massachusets)-Toronto-London: Blaisdall Publishing Company, 1967.MATHGoogle Scholar - 10.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, vol. 241-243, pp. 519–598.MathSciNetCrossRefMATHGoogle Scholar - 11.Lassak, M., Parallelotopes of maximum volume in a simplex,
*Discrete Comput. Geom.*, 1999, vol. 21, pp. 449–462.MathSciNetCrossRefMATHGoogle Scholar - 12.Mangano, S.,
*Mathematica Cookbook*, Cambridge: O’Reilly Media Inc., 2010.Google Scholar - 13.Nevskii, M., Properties of axial diameters of a simplex
*Discrete Comput. Geom.*, 2011, vol. 46, no. 2, pp. 301–312.MathSciNetCrossRefGoogle Scholar - 14.Scott, P.R., Lattices and convex sets in space,
*Quart. J. Math.*, 1985, vol. 36, pp. 359–362.MathSciNetCrossRefMATHGoogle Scholar - 15.Scott, P.R., Properties of axial diameters,
*Bull. Austral. Math. Soc.*, 1989, vol. 39, pp. 329–333.MathSciNetCrossRefMATHGoogle Scholar