Symmetric and Almost Symmetric semigroups generated by an almost generalized arithmetic sequence, Frobenius number
Résumé
Let $a, d, k,h, c$ be positive integers. Recall that a {\it numerical almost generalized arithmetic sequence-semigroup } (numerical AAG-semigroup for short) is a semigroup minimally generated by relatively prime integers $a, ha+d, ha+2d, \ldots, ha+kd, c, $ that is its embedding dimension is $k+2.$ In \cite{M-D} was described a \gbb of the ideal defining $S$ under one technical assumption, the complete case will be published in a forthcoming paper. In this paper we give a complete description of $S$ when is symmetric or almost symmetric and a quadratic formula for its Frobenius number. Note that our results generalizes and extends previous result of \cite{RR}, \cite{GRR} and \cite{R-G}. Given $a, d, k,h, c$ a simple algorithm allows us to determine if $S$ is almost symmetric.
Origine | Fichiers produits par l'(les) auteur(s) |
---|