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 (3)
| Label | Occurrences |
|---|---|
| Endre Szemerédi canonical | 7 |
| E. Szemerédi | 1 |
| Szemerédi | 1 |
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.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
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.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
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
ⓘ
Gödel Prize ⓘ Hungarian State Prize ⓘ
linked to:
Hungarian State Prize (mathematics-related)
Leroy P. Steele Prize for Seminal Contribution to Research ⓘ
linked to:
Leroy P. Steele Prize
Pólya Prize ⓘ Rolf Schock Prize in Mathematics ⓘ
linked to:
Rolf Schock Prizes
Széchenyi Prize ⓘ |
| citizenship |
Hungary
ⓘ
United States of America ⓘ |
| countryOfBirth | Hungary ⓘ |
| dateOfBirth | 1940-08-21 ⓘ |
| doctoralAdvisor | Pál Turán ⓘ |
| educatedAt |
Eötvös Loránd University
ⓘ
linked to:
University of Budapest
|
| employer |
Alfréd Rényi Institute of Mathematics
ⓘ
Rutgers University ⓘ |
| familyName |
Szemerédi
ⓘ
linked to:
Endre Szemerédi
|
| fieldOfWork |
combinatorics
ⓘ
discrete mathematics ⓘ theoretical computer science ⓘ |
| gender | male ⓘ |
| givenName | Endre ⓘ |
| hasAcademicDiscipline | mathematics ⓘ |
| influencedBy |
Paul Erdős
ⓘ
linked to:
Pál Erdős
Pál Turán ⓘ |
| knownFor |
Szemerédi regularity lemma
ⓘ
Szemerédi's theorem ⓘ Szemerédi–Trotter theorem ⓘ 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
ⓘ
Hungarian Academy of Sciences ⓘ National Academy of Sciences of the United States of America ⓘ
linked to:
National Academy of Sciences
|
| name | Endre Szemerédi ⓘ |
| notableConcept |
Szemerédi regularity lemma
ⓘ
Szemerédi's theorem ⓘ Szemerédi–Trotter theorem ⓘ |
| notableWork |
"On sets of integers containing no k elements in arithmetic progression"
ⓘ
linked to:
Szemerédi's theorem
Szemerédi regularity lemma paper ⓘ
linked to:
Szemerédi regularity lemma
|
| 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.
Instruction
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.
Input
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 (9)
Full triples — surface form annotated when it differs from this entity's canonical label.