Numerical semigroups on compound sequences
Commutative Algebra
2018-08-15 v3
Abstract
We generalize the geometric sequence to allow the copies of (resp. ) to all be different. We call the sequence 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.
Cite
@article{arxiv.1503.05993,
title = {Numerical semigroups on compound sequences},
author = {Claire Kiers and Christopher O'Neill and Vadim Ponomarenko},
journal= {arXiv preprint arXiv:1503.05993},
year = {2018}
}