1. Various approaches for the study of the complexity of some families of pseudorandom subsets
- Author
-
Domingo Gómez-Pérez, Cécile Dartyge, Institut Élie Cartan de Lorraine (IECL), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Universidad de Cantabria [Santander], During the preparation of this paper the second author was par-tially supported by project MTM2014-55421-P from the Ministerio de Economia y Competitividad, and ANR-14-CE34-0009,MuDeRa,Multiplicativity, determinism, and Randomness(2014)
- Subjects
Discrete mathematics ,Pseudorandom number generator ,Combinatorics ,Development (topology) ,Geometry of numbers ,General Mathematics ,Discrete geometry ,Pseudorandomness ,complexity ,Randomness ,[MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT] ,Mathematics - Abstract
International audience; Studying randomness in different structures is important from the development of applications and theory. Dartyge, Mosaki and Sárközy (among others) have studied measures of randomness for families of subsets of integers. In this article, we improve results on the complexity of some families defined by polynomials, introducing new techniques from areas such us combinatorial geometry, geometry of numbers and additive combinatorics.
- Published
- 2017