Curvature Bounds for Neighborhoods of Self-Similar Sets

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 3 figures

Scientific paper

In some recent work, fractal curvatures C^f_k(F) and fractal curvature measures C^f_k(F, .), k = 0, ..., d, have been determined for all self-similar sets F in R^d, for which the parallel neighborhoods satisfy a certain regularity condition and a certain rather technical curvature bound. The regularity condition is conjectured to be always satisfied, while the curvature bound has recently been shown to fail in some concrete examples. As a step towards a better understanding of its meaning, we discuss several equivalent formulations of the curvature bound condition and also a very natural technically simpler condition which turns out to be stronger. These reformulations show that the validity this condition does not depend on the choice of the open set and the constant $R$ appearing in the condition and allow to discuss some concrete examples of self-similar sets. In particular, it is shown that the class of sets satisfying the curvature bound condition is strictly larger than the class of sets satisfying the assumption of polyconvexity used in earlier results.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Curvature Bounds for Neighborhoods of Self-Similar Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Curvature Bounds for Neighborhoods of Self-Similar Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Curvature Bounds for Neighborhoods of Self-Similar Sets will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-658594

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.