Erdős–Szemerédi theorem
id:
erd-s-szemer-di-theorem-185-10520874
title:
Erdős–Szemerédi theorem
text:
In arithmetic combinatorics, the Erdős–Szemerédi theorem states that for every finite set A of integers, at least one of A + A, the set of pairwise sums or A ⋅ A, the set of pairwise products form a significantly larger set. More precisely, the Erdős–Szemerédi theorem states that there exist positive constants c and ε such that for any non-empty set A ⊂ N
- max ≥ c | A | 1 + ε. It was proved by Paul Erdős and Endre Szemerédi in 1983. The notation | A | denotes the cardinality of the set A. The
brand slug:
wiki
category slug:
encyclopedia
description:
For every finite set of real numbers, the pairwise sums or products form a bigger set
original url:
https://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93Szemer%C3%A9di_theorem
date created:
2012-03-10T02:51:58Z
date modified:
2024-09-07T20:20:45Z
main entity:
{"identifier":"Q3526986","url":"https://www.wikidata.org/entity/Q3526986"}
image:
fields total:
13
integrity:
15