Division codes and an area theorem (Q736012): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Property / reviewed by
 
Property / reviewed by: Włodzimierz A. Ślȩzak / rank
Normal rank
 

Revision as of 07:13, 22 February 2024

scientific article
Language Label Description Also known as
English
Division codes and an area theorem
scientific article

    Statements

    Division codes and an area theorem (English)
    0 references
    0 references
    26 October 2009
    0 references
    Let \(A\), \(B\) be two bounded subsets of \(m\)-dimensional Euclidean space, whose closures are Jordan-measurable, \(\mu_1= \mu(\overline A)\), \(\mu+2= \mu(\overline B)\neq 0\). It is proved that there exist limits: \[ \lim_{n\to\infty} {e_n(A)\over e_n(B)}= \lim_{n\to\infty} {d_n(A)\over d_n(B)}= \root m\of{{\mu_1\over\mu_2}}. \] In the above formula \(d_n(A)\) means the division code of \(A\), vis.: \[ d_n(A)= \text{inf}\Biggl\{x> 0: A\subset A_1\cup A_2\cup\cdots\cup A_n,\max_{1\leq i\leq n}\,\text{diam\,}A_i\leq x\Biggr\}, \] and \(e_n(A)= \root m\of{{n}}\), \(d_n(A)\) stands for the normalized division code of \(A\). Such codes are, in the case of plane sets, already described in cited papers, but an area theorem provded in the present paper may be treated as its new, important property.
    0 references
    Jordan measure
    0 references
    division code
    0 references
    normalized division code
    0 references

    Identifiers