Real periodicity theorem for division codes (Q656247): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:52, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Real periodicity theorem for division codes |
scientific article |
Statements
Real periodicity theorem for division codes (English)
0 references
17 January 2012
0 references
Let \(\Phi\) be an arbitrary bounded set in \({\mathbb R}^m\) and \(n\) be a positive integer. Let \(d_{n}^{m}(\Phi)\) stand for the infimum of positive real numbers \(x\) such that \(\Phi\) can be covered with \(n\) sets whose diameters do not exceed \(x\). The sequences of values \(d_{n}^{m}(\Phi)\) and \(e_{n}^{m}(\Phi):=n^{1/m}d_{n}^{m}(\Phi)\), \(n=1,2,\dots\), are called the division code and normalized division code of \(\Phi\), respectively. The main result of the paper is the following real periodicity theorem: For any bounded set \(\Phi\subset{\mathbb R}^m\) with a Jordan measurable closure of non-zero measure and for an arbitrary real \(r>0\), there exists the limit \[ \lim\limits_{n\to\infty} \frac{e^{m}_{[rn]}(\Phi)}{e^{m}_{n}(\Phi)}=1. \]
0 references