Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
n-tuples of non-negative integers
|
| gptkbp:category |
gptkb:well-quasi-ordering
|
| gptkbp:field |
gptkb:algebra
gptkb:mathematics combinatorics |
| https://www.w3.org/2000/01/rdf-schema#label |
Dickson's lemma
|
| gptkbp:implies |
gptkb:Hilbert's_basis_theorem
|
| gptkbp:namedAfter |
gptkb:Leonard_Eugene_Dickson
|
| gptkbp:publishedIn |
gptkb:Dickson,_L._E._(1913),_Finiteness_of_the_odd_perfect_and_primitive_abundant_numbers_with_n_distinct_prime_factors,_American_Journal_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:Hilbert's_basis_theorem
well-foundedness Noetherian property |
| gptkbp:sentence |
Every set of n-tuples of non-negative integers has a finite subset such that every element of the set is greater than or equal to some element of the subset componentwise.
|
| gptkbp:usedIn |
Gröbner basis theory
theory of monomial ideals |
| gptkbp:bfsParent |
gptkb:Leonard_Eugene_Dickson
|
| gptkbp:bfsLayer |
6
|