کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5777445 | 1632753 | 2017 | 26 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Scribability problems for polytopes
ترجمه فارسی عنوان
مشکلات نقاشی برای چند جمله ای
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
چکیده انگلیسی
In this paper we study various scribability problems for polytopes. We begin with the classical k-scribability problem proposed by Steiner and generalized by Schulte, which asks about the existence of d-polytopes that cannot be realized with all k-faces tangent to a sphere. We answer this problem for stacked and cyclic polytopes for all values of d and k. We then continue with the weak scribability problem proposed by Grünbaum and Shephard, for which we complete the work of Schulte by presenting non weakly circumscribable 3-polytopes. Finally, we propose new (i,j)-scribability problems, in a strong and a weak version, which generalize the classical ones. They ask about the existence of d-polytopes that cannot be realized with all their i-faces “avoiding” the sphere and all their j-faces “cutting” the sphere. We provide such examples for all the cases where jâiâ¤dâ3.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 64, August 2017, Pages 1-26
Journal: European Journal of Combinatorics - Volume 64, August 2017, Pages 1-26
نویسندگان
Hao Chen, Arnau Padrol,