On large families of subsets of the set of the integers not exceeding N

Cécile Dartyge, Elie Mosaki, A. Sárközy

Research output: Contribution to journalArticle

13 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)209-229
Number of pages21
JournalRamanujan Journal
Volume18
Issue number2
DOIs
Publication statusPublished - Feb 2009

Fingerprint

Integer
Subset
Pseudorandomness
Family

Keywords

  • Pseudo-random
  • Subset

ASJC Scopus subject areas

  • Algebra and Number Theory

Cite this

On large families of subsets of the set of the integers not exceeding N. / Dartyge, Cécile; Mosaki, Elie; Sárközy, A.

In: Ramanujan Journal, Vol. 18, No. 2, 02.2009, p. 209-229.

Research output: Contribution to journalArticle

Dartyge, Cécile ; Mosaki, Elie ; Sárközy, A. / On large families of subsets of the set of the integers not exceeding N. In: Ramanujan Journal. 2009 ; Vol. 18, No. 2. pp. 209-229.
@article{40faa4b1150a4b698e9b6dc60b9b61ab,
title = "On large families of subsets of the set of the integers not exceeding N",
abstract = "In an earlier paper Dartyge and S{\'a}rk{\"o}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",
author = "C{\'e}cile Dartyge and Elie Mosaki and A. S{\'a}rk{\"o}zy",
year = "2009",
month = "2",
doi = "10.1007/s11139-008-9135-z",
language = "English",
volume = "18",
pages = "209--229",
journal = "Ramanujan Journal",
issn = "1382-4090",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - On large families of subsets of the set of the integers not exceeding N

AU - Dartyge, Cécile

AU - Mosaki, Elie

AU - Sárközy, A.

PY - 2009/2

Y1 - 2009/2

N2 - 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.

AB - 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.

KW - Pseudo-random

KW - Subset

UR - http://www.scopus.com/inward/record.url?scp=59949099886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=59949099886&partnerID=8YFLogxK

U2 - 10.1007/s11139-008-9135-z

DO - 10.1007/s11139-008-9135-z

M3 - Article

VL - 18

SP - 209

EP - 229

JO - Ramanujan Journal

JF - Ramanujan Journal

SN - 1382-4090

IS - 2

ER -