Triple
T6327843
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | enumerative combinatorics |
E141901
|
entity |
| Predicate | usesConcept |
P531
|
FINISHED |
| Object |
Burnside's lemma
Burnside's lemma is a result in group theory and combinatorics that counts distinct configurations under symmetries by averaging the number of fixed points of group actions.
|
E586575
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c008d201748190917e69c41ba3f978 |
elicitation | completed |
| NER | batch_69c064e9532081908277f10ec380a486 |
ner | completed |
| NED1 | batch_69c60410223081908c1cf3663d4b14c0 |
ned_source_triple | completed |
| NED2 | batch_69c606bd2228819082fcb63493664927 |
ned_description | completed |
| NEDg | batch_69c60626724881908e6270c2d3652c16 |
nedg | completed |
Created at: March 22, 2026, 4:29 p.m.