TY -
T1 - On the distance sets of Ahlfors-David regular sets
SN - /
UR - http://hdl.handle.net/10138/313040
T3 -
A1 - Orponen, Tuomas
A2 -
PB -
Y1 - 2017
LA - eng
AB - prove that if empty set not equal K subset of R-2 is a compact s-Ahlfors-David regular set with s >= 1, then dim(p) D(K) = 1, where D(K) := {vertical bar x - y vertical bar : x, y is an element of K} is the distance set of K, and dime stands for packing dimension. The same proof strategy applies to other problems of similar nature. For instance, one can show that if empty set not equal K subset of R-2 is a compact s-Ahlfors David regular set with s >= 1, then there exists a point x(0) is an elem...
VO -
IS -
SP -
OP -
KW - Distance sets; Packing dimension; Entropy; 111 Mathematics
N1 -
PP -
ER -