Irregularities of distribution and geometry of planar convex sets
نویسندگان
چکیده
We consider a planar convex body C and we prove several analogs of Roth's theorem on irregularities distribution. When ∂ is 2 regardless curvature, that for every set P N points in T have the sharp bound ∫ 0 1 | card ( ∩ τ + t ) − d ⩾ c / . only piecewise not polygon 5 also give whole range intermediate results between Our proofs depend lemma Cassels-Montgomery, ad hoc constructions finite point sets, geometric type estimate average decay Fourier transform characteristic function
منابع مشابه
Irregularities of Point Distribution Relative to Convex Polygons Iii
The situation is somewhat different when the aligned rectangles are replaced by similar copies of a given convex polygon. More precisely, suppose that 0 is a distribution of N points in the unit square U ̄ [0, 1]#, treated as a torus. Suppose that AXU is a closed convex polygon of diameter less than 1 and with centre of gravity at the origin O. For every real number r satisfying 0% r% 1 and ever...
متن کاملBlind approximation of planar convex sets
The process of learning the shape of an unknown convex planar object through an adaptive process of simple measurements called Line probings, which reveal tangent lines to the object, is considered. A systematic probing strategy is suggested and an upper bound on the number of probings it requires for achieving an approximation with a pre-specified precision to the unknown object is derived. A ...
متن کاملAdaptive Estimation of Planar Convex Sets
In this paper, we consider adaptive estimation of an unknown planar compact, convex set from noisy measurements of its support function. Both the problem of estimating the support function at a point and that of estimating the whole convex set are studied. For pointwise estimation, we consider the problem in a general non-asymptotic framework, which evaluates the performance of a procedure at e...
متن کاملk-Sets of Convex Inclusion Chains of Planar Point Sets
Given a set V of n points in the plane, we introduce a new number of k-sets that is an invariant of V : the number of k-sets of a convex inclusion chain of V . A convex inclusion chain of V is an ordering (v1, v2, ..., vn) of the points of V such that no point of the ordering belongs to the convex hull of its predecessors. The k-sets of such a chain are then the distinct k-sets of all the subse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2022
ISSN: ['1857-8365', '1857-8438']
DOI: https://doi.org/10.1016/j.aim.2021.108162