Search arXivSearch

arXiv · 2605.19158

An algorithm for invariants of elementary abelian groups

Abstract

When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many minimal generators, but efficiently finding a generating set is not a trivial task. We present a new algorithm for computing the invariant ring for elementary abelian groups acting on polynomial rings with complex coefficients (or any other field of characteristic zero). We follow a two-step process: first we generate a collection of $n-k$ "seed" invariants by calculating the kernel of a weight matrix that encodes our action. After we find the seeds, we "grow" them into a generating set for the invariant ring by exploiting the lattice structure of invariants modulo $p$. Our algorithm performs better than the one currently available in Macaulay2, allowing us to compute invariants more quickly in this setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sasha Arasha, Marcus Cassell, Mal Dolorfino, Francesca Gandini, Gordie Novak, Daniel Qin, Sumner Strom. 2026-05-18. An algorithm for invariants of elementary abelian groups. https://arxiv.org/abs/2605.19158

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Generalized Additive Decompositions of Symmetric Tensors

This article addresses the Generalized Additive Decomposition (GAD) of symmetric tensors, that is, degree-$d$ forms $f \in \mathcal{S}_d$. From a geometric perspective, a GAD corresponds to representing a point on a secant of osculating varieties to the Veronese variety, providing a compact and structured description of a tensor that captures its intrinsic algebraic properties. We provide a linear algebra method for measuring the GAD size and prove that the minimal achievable size, which we call the GAD-rank of the considered tensor, coincides with the rank of suitable Catalecticant matrices, under certain regularity assumptions. We provide a new explicit description of the apolar scheme associated with a GAD as the annihilator of a polynomial-exponential series. We show that if the Castelnuovo-Mumford regularity of this scheme is sufficiently small, then both the GAD and the associated apolar scheme are minimal and unique. Leveraging these results, we develop a numerical GAD algorithm for symmetric tensors that effectively exploits the underlying algebraic structure, extending existing algebraic approaches based on eigen computation to the treatment of multiple points. We illustrate the effectiveness and numerical stability of such an algorithm through several examples, including Waring and tangential decompositions.

math.AC

Numerical Semigroups of Sally Type II

In this paper we study numerical semigroups of Sally type of multiplicity $e$ and embedding dimension $ν\ge e-2$. We construct the minimal resolutions for these semigroup rings when they are symmetric and compute their Betti numbers. We also construct a minimal resolution for another special class of such semigroups of type $ν-1$. Finally, we propose some conjectures for the Betti numbers of families of non-symmetric Sally type semigroups in the above cases in relation to those of the corresponding Gorenstein cases of Sally type semigroups.

math.AC

Matrix equivalence to Smith normal form: new theoretical results for multivariate polynomial matrices

This paper investigates the Smith normal form equivalence problem for multivariate polynomial matrices. Using methods from matrix theory and polynomial ideal theory, we prove that Frost and Storey's 1978 conjecture holds for a broad class of matrices: such a matrix is equivalent to its Smith normal form if and only if its reduced minors of each order generate the unit ideal. Moreover, by extending the original matrix class via automorphisms of the polynomial ring, we show that our framework applies in a substantially more general setting.

math.AC