A Combinatorial Model of Numerical Semigroup

MaRDI QIDQ6439347zbMATH OpenFDO

Authors Feihu Liu, Guoce Xin, Suting Ye, Jingjing Yin

Publication date 6 June 2023

Abstract: Let $A=(a_1,a_2,\mathrm{...},a_n)$ be relative prime positive integers with $a_{i}geq2$. The Frobenius number $F(A)$ is the largest integer not belonging to the numerical semigroup $langleAangle$ generated by $A$. The genus $g(A)$ is the number of positive integer elements that are not in $langleAangle$. The Frobenius problem is to find $F(A)$ and $g(A)$ for a given sequence $A$. In this paper, we study the Frobenius problem of $A=(a,2a+d,2^{2}a+3d,\mathrm{...},2^{k}a+(2^k-1)d)$ and obtain formulas for $F(A)$ and $g(A)$ when $a+dgeqk$. Our formulas simplifies further for some special cases, such as Mersenne and Thabit numerical semigroups. We obtain explicit formulas for generalized Mersenne and Thabit numerical semigroups and some more general numerical semigroups.

This page was built for publication: A Combinatorial Model of Numerical Semigroup

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