Endre Szemerédi
E557241
Endre Szemerédi is a Hungarian-American mathematician renowned for his fundamental contributions to combinatorics and theoretical computer science, including Szemerédi's theorem on arithmetic progressions.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Endre Szemerédi canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T5896716 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
Target entity: Endre Szemerédi Context triple: [Pál Erdős, notableStudent, Endre Szemerédi]
-
A.
Pál Erdős
Pál Erdős was a highly prolific 20th-century Hungarian mathematician renowned for his extensive contributions to number theory, combinatorics, and discrete mathematics, as well as his famously collaborative working style.
-
B.
Pál Turán
Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
-
C.
Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
-
D.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
E.
Klaus Roth
Klaus Roth was a German-born British mathematician renowned for his groundbreaking work in number theory, particularly his proof of Roth's theorem on Diophantine approximation, for which he received the Fields Medal in 1958.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Endre Szemerédi Target entity description: Endre Szemerédi is a Hungarian-American mathematician renowned for his fundamental contributions to combinatorics and theoretical computer science, including Szemerédi's theorem on arithmetic progressions.
-
A.
Pál Erdős
Pál Erdős was a highly prolific 20th-century Hungarian mathematician renowned for his extensive contributions to number theory, combinatorics, and discrete mathematics, as well as his famously collaborative working style.
-
B.
Pál Turán
Pál Turán was a Hungarian mathematician renowned for his influential work in number theory and combinatorics, including the development of Turán's theorem in extremal graph theory.
-
C.
Alfréd Rényi
Alfréd Rényi was a Hungarian mathematician renowned for his influential work in probability theory, information theory, and number theory.
-
D.
Miklos Ajtai
Miklós Ajtai is a Hungarian-American computer scientist renowned for his foundational contributions to computational complexity theory and lattice-based cryptography.
-
E.
Klaus Roth
Klaus Roth was a German-born British mathematician renowned for his groundbreaking work in number theory, particularly his proof of Roth's theorem on Diophantine approximation, for which he received the Fields Medal in 1958.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
Hungarian-American mathematician
ⓘ
human ⓘ mathematician ⓘ |
| awardReceived |
Abel Prize
NERFINISHED
ⓘ
Gödel Prize NERFINISHED ⓘ Hungarian State Prize NERFINISHED ⓘ Leroy P. Steele Prize for Seminal Contribution to Research NERFINISHED ⓘ Pólya Prize NERFINISHED ⓘ Rolf Schock Prize in Mathematics NERFINISHED ⓘ Széchenyi Prize NERFINISHED ⓘ |
| citizenship |
Hungary
NERFINISHED
ⓘ
United States of America ⓘ |
| countryOfBirth | Hungary NERFINISHED ⓘ |
| dateOfBirth | 1940-08-21 ⓘ |
| doctoralAdvisor | Pál Turán NERFINISHED ⓘ |
| educatedAt | Eötvös Loránd University NERFINISHED ⓘ |
| employer |
Alfréd Rényi Institute of Mathematics
NERFINISHED
ⓘ
Rutgers University NERFINISHED ⓘ |
| familyName | Szemerédi NERFINISHED ⓘ |
| fieldOfWork |
combinatorics
ⓘ
discrete mathematics ⓘ theoretical computer science ⓘ |
| gender | male ⓘ |
| givenName | Endre NERFINISHED ⓘ |
| hasAcademicDiscipline | mathematics ⓘ |
| influencedBy |
Paul Erdős
NERFINISHED
ⓘ
Pál Turán NERFINISHED ⓘ |
| knownFor |
Szemerédi regularity lemma
NERFINISHED
ⓘ
Szemerédi's theorem NERFINISHED ⓘ Szemerédi–Trotter theorem NERFINISHED ⓘ contributions to extremal combinatorics ⓘ contributions to graph theory ⓘ contributions to theoretical computer science ⓘ work on arithmetic progressions in dense sets of integers ⓘ |
| languageOfWorkOrName |
English
ⓘ
Hungarian ⓘ |
| memberOf |
Academia Europaea
NERFINISHED
ⓘ
Hungarian Academy of Sciences NERFINISHED ⓘ National Academy of Sciences ⓘ
surface form:
National Academy of Sciences of the United States of America
|
| name | Endre Szemerédi NERFINISHED ⓘ |
| notableConcept |
Szemerédi regularity lemma
NERFINISHED
ⓘ
Szemerédi's theorem NERFINISHED ⓘ Szemerédi–Trotter theorem NERFINISHED ⓘ |
| notableWork |
"On sets of integers containing no k elements in arithmetic progression"
NERFINISHED
ⓘ
Szemerédi regularity lemma paper NERFINISHED ⓘ |
| placeOfBirth | Budapest ⓘ |
| positionHeld | professor at Rutgers University ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Subject: Endre Szemerédi Description of subject: Endre Szemerédi is a Hungarian-American mathematician renowned for his fundamental contributions to combinatorics and theoretical computer science, including Szemerédi's theorem on arithmetic progressions.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.