Related papers: On the Frobenius Number of Fibonacci Numerical Sem…
We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…
We study the structure of the family of numerical semigroups with fixed multiplicity and Frobenius number. We give an algorithmic method to compute all the semigroups in this family. As an application we compute the set of all numerical…
In this paper we study numerical semigroups generated by three elements. We give a characterization of pseudo-symmetric numerical semigroups. Also, we will give a simple algorithm to get all the pseudo-symmetric numerical semigroups with…
This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…
The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of…
We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…
We compute the Frobenius number for sequences of triangular and tetrahedral numbers. In addition, we study some properties of the numerical semigroups associated to those sequences.
A numerical semigroup is irreducible if it cannot be obtained as intersection of two numerical semigroups containing it properly. If we only consider numerical semigroups with the same Frobenius number, that concept is generalized to atomic…
Given a numerical semigroup $S$ and a positive integer $p$, the quotient $\frac{S}{p}=\{x\in \mathbb{N} \mid px\in S\}$ also forms a numerical semigroup. In this paper, we first characterize the Ap\'ery set for a class of quotients of…
We study how certain invariants of numerical semigroups relate to the number of second kind gaps. Furthermore, given two fixed non-negative integers F and k, we provide an algorithm to compute all the numerical semigroups whose Frobenius…
We derive the lower bound for Frobenius number of symmetric (not complete intersection) semigroups generated by four elements.
The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$, and finding the Frobenius number is called the Frobenius problem. In this paper, we solve the Frobenius problem for the numerical…
In this paper we introduce the notion of extension of a numerical semigroup. We provide a characterization of the numerical semigroups whose extensions are all arithmetic and we give an algorithm for the computation of the whole set of…
The symmetric numerical semigroups S(F_a,F_b,F_c) and S(L_k,L_m,L_n) generated by three Fibonacci (F_a,F_b,F_c) and Lucas (L_k,L_m,L_n) numbers are considered. Based on divisibility properties of the Fibonacci and Lucas numbers we establish…
Fixed two positive integers m and e, some algorithms for computing the minimal Frobenius number and minimal genus of the set of numerical semigroups with multiplicity m and embedding dimension e are provided. Besides, the semigroups where…
In this paper, we introduce and study the numerical semigroups generated by $\{a_1, a_2, \ldots \} \subset \mathbb{N}$ such that $a_1$ is the repunit number in base $b > 1$ of length $n > 1$ and $a_i - a_{i-1} = a\, b^{i-2},$ for every $i…
We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.
In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the…
We introduce a module-theoretic approach and a linear-programming method to compute the matricial dimension of numerical semigroups. We use these to compute the matricial dimension of every numerical semigroup with Frobenius number at most…
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…