科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper we will introduce for a convex domain K in the Euclidean plane a function Omega(n)(K, theta) which is called by us the biwidth of K, and then try to find out the least area convex domain with constant biwidth Lambda among all convex domains with the same constant biwidth. When n is an odd integer, it is proved that our problem is just that of Blaschke-Lebesgue, and when n is an even number, we give a lower bound of the area of such constant biwidth domains.
