Real periodicity theorem for division codes
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. \]
This page was built for publication: Real periodicity theorem for division codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656247)
