Division codes and an area theorem (Q736012)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Division codes and an area theorem |
scientific article; zbMATH DE number 5621454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Division codes and an area theorem |
scientific article; zbMATH DE number 5621454 |
Statements
Division codes and an area theorem (English)
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
0.82677161693573
0 references
0.7923046946525574
0 references
0.7757312655448914
0 references
0.6795411109924316
0 references