Theory of dimension for large discrete sets and applications

Simple item page
dc.creatorIosevich, Alex
dc.creatorRudnev, Misha
dc.creatorUriarte-Tuero, Ignacio
dc.date2007-07-09
dc.date.accessioned2026-07-07T08:14:42Z
dc.date.available2026-07-07T08:14:42Z
dc.descriptionWe define two notions of discrete dimension based on the Minkowski and Hausdorff dimensions in the continuous setting. After proving some basic results illustrating these definitions, we apply this machinery to the study of connections between the Erdos and Falconer distance problems in geometric combinatorics and geometric measure theory, respectively.
dc.description27 pages
dc.identifierhttps://arxiv.org/abs/0707.1322
dc.identifierhttp://arxiv.org/abs/0707.1322
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133223
dc.subjectCombinatorics
dc.subjectClassical Analysis and ODEs
dc.subject52C10
dc.titleTheory of dimension for large discrete sets and applications
dc.typetext

Files

Collections

arXiv