Delta sets for nonsymmetric numerical semigroups with embedding dimension three

2018 ◽  
Vol 30 (1) ◽  
pp. 15-30 ◽  
Author(s):  
Pedro A. García-Sánchez ◽  
David Llena ◽  
Alessio Moscariello
Keyword(s):  
Fast Algorithm ◽  
Numerical Semigroup ◽  
Numerical Semigroups ◽  
Embedding Dimension ◽  
Delta Set

Abstract We present a fast algorithm to compute the Delta set of a nonsymmetric numerical semigroup with embedding dimension three. We also characterize the sets of integers that are the Delta set of a numerical semigroup of this kind.

scholarly journals Measuring primality in numerical semigroups with embedding dimension three

2015 ◽  
Vol 15 (01) ◽  
pp. 1650007 ◽  
Author(s):  
S. T. Chapman ◽  
P. A. García-Sánchez ◽  
Z. Tripp ◽  
C. Viola
Keyword(s):  
Numerical Semigroup ◽  
Numerical Semigroups ◽  
Embedding Dimension ◽  
Catenary Degree

In this paper, we find the ω-value of the generators of any numerical semigroup with embedding dimension three. This allows us to determine all possible orderings of the ω-values of the generators. In addition, we relate the ω-value of the numerical semigroup to its catenary degree.

scholarly journals Factoring in Embedding Dimension Three Numerical Semigroups

10.37236/410 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
F. Aguiló-Gost ◽  
P. A. García-Sánchez
Keyword(s):  
Numerical Semigroup ◽  
Main Tool ◽  
Numerical Semigroups ◽  
Embedding Dimension ◽  
Catenary Degree

Let us consider a $3$-numerical semigroup $S=\langle{a,b,N}\rangle$. Given $m\in S$, the triple $(x,y,z)\in\mathbb{N}^3$ is a factorization of $m$ in $S$ if $xa+yb+zN=m$. This work is focused on finding the full set of factorizations of any $m\in S$ and as an application we compute the catenary degree of $S$. To this end, we relate a 2D tessellation to $S$ and we use it as a main tool.

The Frobenius problem for a class of numerical semigroups

2017 ◽  
Vol 13 (05) ◽  
pp. 1335-1347 ◽  
Author(s):  
Ze Gu ◽  
Xilin Tang
Keyword(s):  
Numerical Semigroup ◽  
Frobenius Number ◽  
Numerical Semigroups ◽  
Embedding Dimension ◽  
Frobenius Problem ◽  
Positive Integers

Let [Formula: see text] be two positive integers such that [Formula: see text] and [Formula: see text] the numerical semigroup generated by [Formula: see text]. Then [Formula: see text] is the Thabit numerical semigroup introduced by J. C. Rosales, M. B. Branco and D. Torrão. In this paper, we give formulas for computing the Frobenius number, the genus and the embedding dimension of [Formula: see text].

On the numerical semigroup generated by {bn+1+i+bn+i−1b−1∣i∈N}$\begin{array}{} \{b^{n+1+i}+\frac{b^{n+i}-1}{b-1}\mid i\in\mathbb{N}\} \end{array}$

2020 ◽  
Vol 30 (4) ◽  
pp. 257-264
Author(s):  
Ze Gu
Keyword(s):  
Numerical Semigroup ◽  
Frobenius Number ◽  
Embedding Dimension ◽  
Order Relations ◽  
Positive Integers

AbstractLet b, n be two positive integers such that b ≥ 2, and S(b, n) be the numerical semigroup generated by $\begin{array}{} \{b^{n+1+i}+\frac{b^{n+i}-1}{b-1}\mid i\in\mathbb{N}\} \end{array}$. Applying two order relations, we give formulas for computing the embedding dimension, the Frobenius number, the type and the genus of S(b, n).

scholarly journals Minimal genus of a multiple and Frobenius number of a quotient of a numerical semigroup

2015 ◽  
Vol 25 (06) ◽  
pp. 1043-1053 ◽  
Author(s):  
Francesco Strazzanti
Keyword(s):  
Positive Integer ◽  
Numerical Semigroup ◽  
Frobenius Number ◽  
Numerical Semigroups ◽  
Minimal Genus

Given two numerical semigroups S and T and a positive integer d, S is said to be one over d of T if S = {s ∈ ℕ | ds ∈ T} and in this case T is called a d-fold of S. We prove that the minimal genus of the d-folds of S is [Formula: see text], where g and f denote the genus and the Frobenius number of S. The case d = 2 is a problem proposed by Robles-Pérez, Rosales, and Vasco. Furthermore, we find the minimal genus of the symmetric doubles of S and study the particular case when S is almost symmetric. Finally, we study the Frobenius number of the quotient of some families of numerical semigroups.

scholarly journals Numerical semigroups in a problem about cost-effective transport

2017 ◽  
Vol 29 (2) ◽  
pp. 329-345 ◽  
Author(s):  
Aureliano M. Robles-Pérez ◽  
José Carlos Rosales
Keyword(s):  
Nonnegative Integer ◽  
Numerical Semigroup ◽  
Cost Effective ◽  
Numerical Semigroups ◽  
Integer Coefficients ◽  
Effective Transport ◽  
System Of Inequalities ◽  
Algorithmic Process

AbstractLet ${{\mathbb{N}}}$ be the set of nonnegative integers. A problem about how to transport profitably an organized group of persons leads us to study the set T formed by the integers n such that the system of inequalities, with nonnegative integer coefficients,$a_{1}x_{1}+\cdots+a_{p}x_{p}<n<b_{1}x_{1}+\cdots+b_{p}x_{p}$has at least one solution in ${{\mathbb{N}}^{p}}$. We will see that ${T\cup\{0\}}$ is a numerical semigroup. Moreover, we will show that a numerical semigroup S can be obtained in this way if and only if ${\{a+b-1,a+b+1\}\subseteq S}$, for all ${a,b\in S\setminus\{0\}}$. In addition, we will demonstrate that such numerical semigroups form a Frobenius variety and we will study this variety. Finally, we show an algorithmic process in order to compute T.

Sign in / Sign up

Export Citation Format

Share Document