Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:author |
gptkb:Paul_Erdős
gptkb:Endre_Szemerédi |
| gptkbp:field |
number theory
combinatorics |
| gptkbp:hasConcept |
gptkb:sum-product_problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Erdős–Szemerédi theorem
|
| gptkbp:implies |
at least one of the sum set or product set has size close to quadratic in |A|
|
| gptkbp:namedAfter |
gptkb:Paul_Erdős
gptkb:Endre_Szemerédi |
| gptkbp:publishedIn |
gptkb:Combinatorica
|
| gptkbp:sentence |
For any finite set of integers A, the sum set A+A or the product set A·A is large.
|
| gptkbp:yearProposed |
1983
|
| gptkbp:bfsParent |
gptkb:Paul_Erdős
gptkb:Endre_Szemerédi |
| gptkbp:bfsLayer |
4
|