A Note on Generalized Repunit Numerical Semigroups

MaRDI QIDQ6440708zbMATH OpenFDO

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

Publication date 19 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 note, we study the Frobenius problem of $A=left(a,ba+d,b^{2}a+frac{b}^2-1b-1d,\mathrm{...},b^{k}a+frac{b}^k-1b-1dight)$ and obtain formulas for $F(A)$ and $g(A)$ when $ageqk-1$. Our formulas simplifies further for some special cases, such as repunit, Mersenne and Thabit numerical semigroups. The idea is similar to that in [cite{LiuXin23},arXiv:2306.03459].

This page was built for publication: A Note on Generalized Repunit Numerical Semigroups

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