Covering numbers, dyadic chaining and discrepancy
β Scribed by Christoph Aistleitner
- Book ID
- 113689527
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 222 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## 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
This paper deals with compound nonlinear congruential methods for generating uniform pseudorandom numbers. The average equidistribution and statistical independence behavior of the generated sequences over arbitrary parts of the period is studied, based on the average value of the discrepancy of cer
In this article we introduce the notion of polynomial table algebras, and discuss their covering numbers. In particular, we prove that the real table algebras \((A, \mathbf{B})\) with \(c n(\mathbf{B})=2|\mathbf{B}|-2\) are polynomial table algebras such that, by a suitable reordering of \(x_{i} \in