A Combinatorial Problem
E239174
"A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
All labels observed (1)
| Label | Occurrences |
|---|---|
| A Combinatorial Problem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T2169654 — 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: A Combinatorial Problem Context triple: [N. G. de Bruijn, hasPublication, A Combinatorial Problem]
-
A.
enumerative combinatorics
Enumerative combinatorics is a branch of mathematics focused on counting and characterizing discrete structures, often using generating functions, bijections, and algebraic techniques.
-
B.
Hilbert’s twenty-third problem
Hilbert’s twenty-third problem is one of David Hilbert’s famous list of unsolved problems, focusing on the further development and systematic application of the calculus of variations.
-
C.
Sprague–Grundy theorem
The Sprague–Grundy theorem is a fundamental result in combinatorial game theory that assigns each impartial game position a nonnegative integer (its Grundy value), allowing such games to be analyzed and combined via nim-like addition.
-
D.
Concrete Mathematics
Concrete Mathematics is a widely respected textbook by Ronald Graham, Donald Knuth, and Oren Patashnik that blends continuous and discrete mathematics with an emphasis on problem-solving and rigorous analysis, especially for computer science applications.
-
E.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
- 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: A Combinatorial Problem Target entity description: "A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
-
A.
enumerative combinatorics
Enumerative combinatorics is a branch of mathematics focused on counting and characterizing discrete structures, often using generating functions, bijections, and algebraic techniques.
-
B.
Hilbert’s twenty-third problem
Hilbert’s twenty-third problem is one of David Hilbert’s famous list of unsolved problems, focusing on the further development and systematic application of the calculus of variations.
-
C.
Sprague–Grundy theorem
The Sprague–Grundy theorem is a fundamental result in combinatorial game theory that assigns each impartial game position a nonnegative integer (its Grundy value), allowing such games to be analyzed and combined via nim-like addition.
-
D.
Concrete Mathematics
Concrete Mathematics is a widely respected textbook by Ronald Graham, Donald Knuth, and Oren Patashnik that blends continuous and discrete mathematics with an emphasis on problem-solving and rigorous analysis, especially for computer science applications.
-
E.
Entscheidungsproblem
The Entscheidungsproblem is a foundational decision problem in mathematical logic that asks whether there exists a general algorithm to determine the truth or falsity of any given first-order logical statement.
- F. None of above. chosen
Statements (26)
| Predicate | Object |
|---|---|
| instanceOf |
mathematical paper
ⓘ
research article ⓘ |
| analyzes | fundamental counting problem in combinatorics ⓘ |
| author |
N. G. de Bruijn
ⓘ
Nicolaas Govert de Bruijn ⓘ
linked to:
N. G. de Bruijn
|
| authorAffiliation | N. G. de Bruijn ⓘ |
| citedFor | its treatment of a fundamental counting problem ⓘ |
| contribution |
analysis of a basic structure-counting question
ⓘ
introduction of a fundamental combinatorial counting problem ⓘ |
| describedAs |
classic mathematical paper
ⓘ
fundamental work in combinatorics ⓘ |
| field |
combinatorics
ⓘ
mathematics ⓘ |
| genre | academic journal article ⓘ |
| hasAuthorNationality | Dutch ⓘ |
| hasMainSubject |
combinatorial problems
ⓘ
counting finite structures ⓘ |
| influencedField |
combinatorial theory
ⓘ
enumerative combinatorics ⓘ |
| isClassicIn | combinatorics literature ⓘ |
| language | English ⓘ |
| mathematicsSubject | discrete mathematics ⓘ |
| topic |
combinatorial enumeration
ⓘ
counting problem ⓘ |
| usesMethod |
combinatorial reasoning
ⓘ
enumeration techniques ⓘ |
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: A Combinatorial Problem Description of subject: "A Combinatorial Problem" is a classic mathematical paper by N. G. de Bruijn that introduces and analyzes a fundamental counting problem in combinatorics.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.