اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Inverse Kakeya Problem
91
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We prove that the largest convex shape that can be placed inside a given convex shape $Q subset mathbb{R}^{d}$ in any desired orientation is the largest inscribed ball of $Q$. The statement is true both when largest means largest volume and when it means largest surface area. The ball is the unique solution, except when maximizing the perimeter in the two-dimensional case.
قيم البحث
اقرأ أيضاً
The thirteen spheres problem is asking if 13 equal size nonoverlapping spheres in three dimensions can touch another sphere of the same size. This problem was the subject of the famous discussion between Isaac Newton and David Gregory in 1694. The pr
oblem was solved by Schutte and van der Waerden only in 1953. A natural extension of this problem is the strong thirteen spheres problem (or the Tammes problem for 13 points) which asks to find an arrangement and the maximum radius of 13 equal size nonoverlapping spheres touching the unit sphere. In the paper we give a solution of this long-standing open problem in geometry. Our computer-assisted proof is based on a enumeration of the so-called irreducible graphs.
In this small survey we consider the volume product, and sketch some of the best upper and lower estimates known up to now, based on our paper [BMMR]. The author thanks the organizers of the conference in Jurata, March 2010, for their kind invitation
, and the excellent atmosphere there. This paper is based on the talk of the author on that conference.
The Minkowski problem in Gaussian probability space is studied in this paper. In addition to providing an existence result on a Gaussian-volume-normalized version of this problem, the main goal of the current work is to provide uniqueness and existen
ce results on the Gaussian Minkowski problem (with no normalization required).
Recently, the duals of Federers curvature measures, called dual curvature measures, were discovered by Huang, Lutwak, Yang, and Zhang (ACTA, 2016). In the same paper, they posed the dual Minkowski problem, the characterization problem for dual curvat
ure measures, and proved existence results when the index, q, is in (0,n). The dual Minkowski problem includes the Aleksandrov problem (q = 0) and the logarithmic Minkowski problem (q = n) as special cases. In the current work, a complete solution to the dual Minkowski problem whenever q < 0, including both existence and uniqueness, is presented.
We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve a min-max-
min problem for the logarithmic potential of such polynomials. Using techniques recently developed for polarization (Chebyshev-type) problems, we show that this optimality also holds for a large class of potentials, including the Riesz potentials $1/r^s$ with $s>0.$
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
