Various approaches for the study of the complexity of some families of pseudorandom subsets (Q1687703): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.4171/rmi/974 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2623067539 / rank | |||
Normal rank |
Latest revision as of 08:35, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Various approaches for the study of the complexity of some families of pseudorandom subsets |
scientific article |
Statements
Various approaches for the study of the complexity of some families of pseudorandom subsets (English)
0 references
4 January 2018
0 references
Summary: Studying randomness in different structures is important from the development of applications and theory. Dartyge, Mosaki and Sárközy (among others) [\textit{C. Dartyge} et al., Ramanujan J. 18, No. 2, 209--229 (2009; Zbl 1226.05006)] 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 as combinatorial geometry, geometry of numbers and additive combinatorics.
0 references
pseudorandomness
0 references
complexity
0 references