Numerical semigroups on compound sequences

From MaRDI portal



Abstract: We generalize the geometric sequence ap,ap−1b,ap−2b2,...,bp to allow the p copies of a (resp. b) to all be different. We call the sequence a1a2a3cdotsap,b1a2a3cdotsap,b1b2a3cdotsap,ldots,b1b2b3cdotsbp a emph{compound sequence}. We consider numerical semigroups whose minimal set of generators form a compound sequence, and compute various semigroup and arithmetical invariants, including the Frobenius number, Ap'ery sets, Betti elements, and catenary degree. We compute bounds on the delta set and the tame degree.





Describes a project that uses

Uses Software






This page was built for publication: Numerical semigroups on compound sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817190)