✦ LIBER ✦

Capacity and Covering Numbers

✍ Scribed by Thomas Ransford; Alexis Selezneff

Book ID: 106504452
Publisher: Springer Netherlands
Year: 2011
Tongue: English
Weight: 273 KB
Volume: 36
Category: Article
ISSN: 0926-2601
DOI: 10.1007/s11118-011-9226-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some remarks concerning kissing numbers,

Some remarks concerning kissing numbers, blocking numbers and covering numbers

✍ Chuanming Zong 📂 Article 📅 1995 🏛 Springer Netherlands 🌐 English ⚖ 222 KB

Covering numbers of rotations

✍ Nataliya Chekhova 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 154 KB

For an irrational rotation, we use the symbolic dynamics on the sturmian coding to compute explicitly, according to the continued fraction approximation of the argument, the measure of the largest Rokhlin stack made with intervals, and the measure of the largest Rokhlin stack whose levels have one n

Estimates of covering numbers

✍ B. Carl; A. Hess 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 707 KB

Covering numbers, dyadic chaining and di

Covering numbers, dyadic chaining and discrepancy

✍ Christoph Aistleitner 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 222 KB

On asymmetric coverings and covering num

On asymmetric coverings and covering numbers

✍ David Applegate; E. M. Rains; N. J. A. Sloane 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract An asymmetric covering ${\cal D}(n,R)$ is a collection of special subsets __S__ of an __n__‐set such that every subset __T__ of the __n__‐set is contained in at least one special __S__ with $|S| - |T| \le R$. In this paper we compute the smallest size of any ${\cal D}(n,1)$ for $n \le 8

Covering Numbers in Linear Algebra

✍ Pete L. Clark 📂 Article 📅 2012 🏛 Mathematical Association of America 🌐 English ⚖ 210 KB