|
|||||
|
|
On large families of subsets of the set of the integers not exceeding N |
|
| Authors: | Cécile Dartyge Elie Mosaki András Sárközy |
| Affiliation: | 1. Institut élie Cartan, Université Henri Poincaré—Nancy 1, BP 239, 54506, Vand?uvre Cedex, France 2. Université de Lyon, Université Lyon 1, CNRS, UMR 5208 Institut Camille Jordan, Batiment du Doyen Jean Braconnier, 43, blvd du 11 novembre, 69200, Villeurbanne Cedex, France 3. Department of Algebra and Number Theory, E?tv?s Loránd University, Pf. 120, Pázmány Péter Sétány 1/C, 1117, Budapest, Hungary |
| Abstract: | In an earlier paper Dartyge and Sárközy defined the measures of pseudo-randomness of subsets of {1,2,…,N}, and they presented several examples for subsets with strong pseudo-random properties. However, in applications one usually needs large families of subsets with strong pseudo-random properties. Here two constructions of this type are given. The notion of complexity of families of subsets of {1,…,N} is also introduced and studied. |
| Keywords: | Pseudo-random Subset |
| 本文献已被 SpringerLink 等数据库收录！ | |