Little-o notation
E1350197
UNEXPLORED
Little-o notation is a mathematical notation used in analysis and asymptotic theory to describe functions that grow strictly slower than a given reference function as the input approaches a limit.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Little-o notation canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T18929573 — 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: Little-o notation Context triple: [Du Bois-Reymond theory of orders of infinity, relatedTo, Little-o notation]
-
A.
Big-O notation
Big-O notation is a mathematical tool used in computer science to describe how the running time or space requirements of an algorithm grow relative to the size of its input.
-
B.
Stirling's approximation
Stirling's approximation is a classical formula in mathematics that provides an efficient asymptotic estimate for factorials and the gamma function, especially for large arguments.
-
C.
Knuth’s up-arrow notation
Knuth’s up-arrow notation is a mathematical notation introduced by Donald Knuth to concisely represent very large integers using iterated exponentiation and its higher-order generalizations.
-
D.
Bennett inequality
Bennett inequality is a probabilistic bound that provides exponential tail estimates for sums of independent random variables, refining classical concentration inequalities like Bernstein’s.
-
E.
Littlewood’s three principles of real analysis
Littlewood’s three principles of real analysis are a set of heuristic guidelines that clarify how measurable sets and functions can be approximated and simplified, emphasizing that they are nearly finite, nearly countable, and nearly continuous.
- 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: Little-o notation Target entity description: Little-o notation is a mathematical notation used in analysis and asymptotic theory to describe functions that grow strictly slower than a given reference function as the input approaches a limit.
-
A.
Big-O notation
Big-O notation is a mathematical tool used in computer science to describe how the running time or space requirements of an algorithm grow relative to the size of its input.
-
B.
Stirling's approximation
Stirling's approximation is a classical formula in mathematics that provides an efficient asymptotic estimate for factorials and the gamma function, especially for large arguments.
-
C.
Knuth’s up-arrow notation
Knuth’s up-arrow notation is a mathematical notation introduced by Donald Knuth to concisely represent very large integers using iterated exponentiation and its higher-order generalizations.
-
D.
Bennett inequality
Bennett inequality is a probabilistic bound that provides exponential tail estimates for sums of independent random variables, refining classical concentration inequalities like Bernstein’s.
-
E.
Littlewood’s three principles of real analysis
Littlewood’s three principles of real analysis are a set of heuristic guidelines that clarify how measurable sets and functions can be approximated and simplified, emphasizing that they are nearly finite, nearly countable, and nearly continuous.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.