Erdős–Turán inequality
E1537105
UNEXPLORED
The Erdős–Turán inequality is a fundamental result in analytic number theory that provides quantitative bounds on the discrepancy of sequences by relating uniform distribution to exponential sums.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Erdős–Turán inequality canonical | 2 |
| Erdős–Turán inequality for discrepancy | 1 |
| Erdős–Turán–Koksma inequality | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T22423374 — 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: Erdős–Turán inequality Context triple: [Erdős–Turán conjecture, relatedTo, Erdős–Turán inequality]
-
A.
Turán–Kubilius inequality
The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
-
B.
Erdős–Turán conjecture
The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
-
C.
Pólya–Vinogradov inequality
The Pólya–Vinogradov inequality is a fundamental result in analytic number theory that gives a strong upper bound on character sums, playing a key role in the study of Dirichlet characters and the distribution of primes in arithmetic progressions.
-
D.
Erdős–Wintner theorem
The Erdős–Wintner theorem is a fundamental result in probabilistic number theory that characterizes when an additive arithmetic function has a limiting distribution.
-
E.
Erdős–Kac theorem
The Erdős–Kac theorem is a fundamental result in probabilistic number theory stating that the number of distinct prime factors of a typical integer behaves like a normally distributed random variable.
- 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: Erdős–Turán inequality Target entity description: The Erdős–Turán inequality is a fundamental result in analytic number theory that provides quantitative bounds on the discrepancy of sequences by relating uniform distribution to exponential sums.
-
A.
Turán–Kubilius inequality
The Turán–Kubilius inequality is a fundamental result in probabilistic number theory that provides bounds on the distribution of additive arithmetic functions.
-
B.
Erdős–Turán conjecture
The Erdős–Turán conjecture is an unsolved problem in additive number theory asserting that any subset of the positive integers with divergent sum of reciprocals must contain arbitrarily long arithmetic progressions.
-
C.
Pólya–Vinogradov inequality
The Pólya–Vinogradov inequality is a fundamental result in analytic number theory that gives a strong upper bound on character sums, playing a key role in the study of Dirichlet characters and the distribution of primes in arithmetic progressions.
-
D.
Erdős–Wintner theorem
The Erdős–Wintner theorem is a fundamental result in probabilistic number theory that characterizes when an additive arithmetic function has a limiting distribution.
-
E.
Erdős–Kac theorem
The Erdős–Kac theorem is a fundamental result in probabilistic number theory stating that the number of distinct prime factors of a typical integer behaves like a normally distributed random variable.
- F. None of above. chosen
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Erdős–Turán inequality
linked to: Erdős–Turán inequality