On numerical semigroup elements and the 0- and ∞-norms of their factorizations

Abstract

A numerical semigroup S is a cofinite, additively-closed subset of Z 0 that contains 0, and a factorization of x ∈ S is a k-tuple z = (z1, …, zk) where x = z1a1 + ·s + zkak expresses x as a sum of generators of S = a1, …, ak . Much~of the study of non-unique factorization centers on factorization length z1 + ·s + zk, which coincies with the 1-norm of z as the k-tuple. In this paper, we study the ∞-norm and 0-norm of factorizations, viewed as alternative notions of length, with particular focus on the generalizations ∞(x) and 0(x) of the delta set (x) from classical factorization length. We prove that the ∞-delta set ∞(x) is eventually periodic as a function of x ∈ S, classify ∞(S) and the 0-delta set 0(S) for several well-studied families of numerical semigroups, and identify families of numerical semigroups demonstrating ∞(S) and 0(S) can be arbitrarily long intervals and can avoid arbitrarily long subintervals.

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…