与匹多不等式有关的一个等式

与匹多不等式有关的一个等式方明（四川平昌二中６３５４００）约定ａ，ｂ，ｃ，△和ａ′，ｂ′，ｃ′，△′分别表示△ＡＢＣ和△Ａ′Ｂ′Ｃ′的边长和面积，Ｈ＝ａ′２（ｂ２＋ｃ２－ａ２）＋ｂ′２（ｃ２＋ａ２－ｂ２）＋ｃ′２（ａ２＋ｂ２－ｃ２）．著名的匹多不等式...     

关于Alexander猜想的几何不等式

本文获得了一类关于度量如单形的体积和外接超球半径的几何不等式,作为其应用,给出了一些重要的推论。     

高维欧氏空间中的广义度量方程及其应用

本文利用代数的方法，证明了：对于两个等数量有限基本元素构成的集合，杨路和张景中关于高维欧氏空间E^n中的度量方程仍然成立，得到了一个广义度量方程，其特殊情况就是著名的Cayley定理．作为初步应用，给出了两个单形外接超球球心距和棱切超球球心距的两个公式.     

有关度量加的几个几何不等式

本文利用代数的方法建立了一个与距离几何中度量加单形的体积和外接超球半径有关的几何不等式,作为其应用,由此可以导出一系列重要的几何不等式.在文末还给出了“广义度量加”的概念,并提出若干猜想供进一步研究.     

一个几何不等式的一般形式

文 [1 ]建立了关于 n维单形的棱长、体积与外接球半径的一个不等式 ,本文给出了这一结论的一般形式     

An Inequality for the Pedal Simplex

In this paper, we improve an inequality on the volume of the pedal simplex.     

关于Veljan-Korchmaros不等式的改进

利用距离几何理论和数学归纳法相结合的方法,证明和改进了著名的Veljan-Korchmaros不等式,得到了三个更强的结果.并应用它推广了n维Euler不等式.     

Some basic inequalities in higher dimensional non-Euclid space

In this paper, the concept of a finite mass-points system∑N(H(A))(N>n) being in a sphere in an n-dimensional hyperbolic space Hn and a finite mass-points system∑N(S(A))(N>n) being in a hyperplane in an n-dimensional spherical space Sn is introduced, then, the rank of the Cayley-Menger matrix AN(H)(or a AN(S)) of the finite mass-points system∑∑N(S(A))(or∑N(S(A))) in an n-dimensional hyperbolic space Hn (or spherical space Sn) is no more than n 2 when∑N(H(A))(N>n) (or∑N(S(A))(N>n)) are in a sphere (or hyperplane). On the one hand, the Yang-Zhang's inequalities, the Neuberg-Pedoe's inequalities and the inequality of the metric addition in an n-dimensional hyperbolic space Hn and in an n-dimensional spherical space Sn are established by the method of characteristic roots. These are basic inequalities in hyperbolic geometry and spherical geometry. On the other hand, some relative problems and conjectures are brought.     

关于四面体的Bonnesen型等周不等式

主要研究几何体的Bonnesen型等周不等式.得到了两个关于四面体的Bonnesen型等周不等式;进一步地,给出了关于四面体的等周不等式的一个简单证明.     

An Inequality on the Coding Gain of Densest Lattice Packings in Successive Dimensions

A lower bound of the form is derived on the coding gain of the densest n-dimensional (n-D) lattice(s). The bound is obtained based on constructing an n-D lattice which consists of parallel layers. Each layer isselected as a translated version of a densest ( n-1)-D lattice.0The relative positioning of the layers is adjusted to make the coding gainas large as possible. For large values of n, the bound isimproved through tightening Ryskov's inequality on covering radius andminimum distance of a lattice.