首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4篇
  免费   0篇
数学   4篇
  2013年   1篇
  2006年   1篇
  2003年   1篇
  2000年   1篇
排序方式: 共有4条查询结果,搜索用时 15 毫秒
1
1.
The convex hull of all integral points contained in a compact polyhedron C is obviously a compact polyhedron. If C is not compact, then the convex hull K of its integral points need not be a closed set. However, under some natural assumptions, K is a closed set and a generalized polyhedron. Bibliography: 11 titles.  相似文献   
2.
3.
A Klein polyhedron is the convex hull of the nonzero integral points of a simplicial coneC⊂ ℝn. There are relationships between these polyhedra and the Hilbert bases of monoids of integral points contained in a simplicial cone. In the two-dimensional case, the set of integral points lying on the boundary of a Klein polyhedron contains a Hilbert base of the corresponding monoid. In general, this is not the case if the dimension is greater than or equal to three (e.g., [2]). However, in the three-dimensional case, we give a characterization of the polyhedra that still have this property. We give an example of such a sail and show that our criterion does not hold if the dimension is four. CEREMADE, University Paris 9. Translated from Funktsional'nyi Analiz i Ego Prilozheniya, Vol. 34, No. 2, pp. 43–49, April–June, 2000. Translated by J.-O. Moussafir  相似文献   
4.
We consider the problem of computing the entropy of a braid. We recall its definition and for each braid construct a sequence of real numbers whose limit is the braid’s entropy. We state one conjecture on the convergence speed and two conjectures on braids that have high entropy but are written with few letters.   相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号