Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory (Q1087559)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory |
scientific article |
Statements
Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory (English)
0 references
1986
0 references
The authors' motivation to write this paper came from the invariant theory and was strictly related to Hilbert's finiteness theorem. In this paper, an elementary combinatorial construction of generators for the invariants of decomposable forms is obtained as an application of the main result stating that numbers D(n), D(n,k) (specified in the paper) are finite.
0 references
regular hypergraph
0 references
invariant theory
0 references
finiteness theorem
0 references
generators
0 references
decomposable forms
0 references
