Papers
Topics
Authors
Recent
Search
2000 character limit reached

Generalized rectifiability of measures and the identification problem

Published 27 Mar 2018 in math.CA and math.MG | (1803.10022v2)

Abstract: One goal of geometric measure theory is to understand how measures in the plane or higher dimensional Euclidean space interact with families of lower dimensional sets. An important dichotomy arises between the class of rectifiable measures, which give full measure to a countable union of the lower dimensional sets, and the class of purely unrectifiable measures, which assign measure zero to each distinguished set. There are several commonly used definitions of rectifiable and purely unrectifiable measures in the literature (using different families of lower dimensional sets such as Lipschitz images of subspaces or Lipschitz graphs), but all of them can be encoded using the same framework. In this paper, we describe a framework for generalized rectifiability, review a selection of classical results on rectifiable measures in this context, and survey recent advances on the identification problem for Radon measures that are carried by Lipschitz or H\"older or $C{1,\alpha}$ images of Euclidean subspaces, including theorems of Azzam-Tolsa, Badger-Schul, Badger-Vellis, Edelen-Naber-Valtorta, Ghinassi, and Tolsa-Toro. This survey paper is based on a talk at the Northeast Analysis Network Conference held in Syracuse, New York in September 2017.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.