Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory
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.
scientific article; zbMATH DE number 3987322
scientific article