English

Numerical semigroups on compound sequences

Commutative Algebra 2018-08-15 v3

Abstract

We generalize the geometric sequence {ap,ap1b,ap2b2,...,bp}\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\} to allow the pp copies of aa (resp. bb) to all be different. We call the sequence {a1a2a3ap,b1a2a3ap,b1b2a3ap,,b1b2b3bp}\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots, b_1b_2b_3\cdots b_p\} 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.

Keywords

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}
}
R2 v1 2026-06-22T08:57:48.071Z