Two-step algorithm finds n-k seed invariants from the kernel of a weight matrix encoding the group action then grows them into a full generating set by exploiting the lattice structure of invariants modulo p.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An algorithm for invariants of elementary abelian groups
Two-step algorithm finds n-k seed invariants from the kernel of a weight matrix encoding the group action then grows them into a full generating set by exploiting the lattice structure of invariants modulo p.