Primary Decomposition of Symmetric Ideals

Abstract

We propose an effective method for primary decomposition of symmetric ideals. Let K[X]=K[x1,…,xn] be the n-valuables polynomial ring over a field K and Sn the symmetric group of order n. We consider the canonical action of Sn on K[X] i.e. σ(f(x1,…,xn))=f(xσ(1),…,xσ(n)) for σ∈ Sn. For an ideal I of K[X], I is called symmetric if σ(I)=I for any σ∈ Sn. For a minimal primary decomposition I=Q1 ·s Qr of a symmetric ideal I, σ(I)=σ (Q1) ·s σ(Qr) is a minimal primary decomposition of I for any σ∈ Sn. We utilize this property to compute a full primary decomposition of I efficiently from partial primary components. We investigate the effectiveness of our algorithm by implementing it in the computer algebra system Risa/Asir.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…