scholarly journals Parametrizing Arf numerical semigroups

2017 ◽  
Vol 16 (11) ◽  
pp. 1750209 ◽  
Author(s):  
P. A. García-Sánchez ◽  
B. A. Heredia ◽  
H. İ. Karakaş ◽  
J. C. Rosales
Keyword(s):  
Numerical Semigroup ◽  
Frobenius Number ◽  
Numerical Semigroups ◽  
Arf Numerical Semigroup

We present procedures to calculate the set of Arf numerical semigroups with given genus, given conductor and given genus and conductor. We characterize the Kunz coordinates of an Arf numerical semigroup. We also describe Arf numerical semigroups with fixed Frobenius number and multiplicity up to 7.

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 of small and large type

2021 ◽  
pp. 1-20
Author(s):  
Deepesh Singhal
Keyword(s):  
Numerical Semigroup ◽  
Frobenius Number ◽  
Numerical Semigroups ◽  
Natural Numbers ◽  
Type Formula ◽  
Explicit Characterization ◽  
Large Type ◽  
Number Formula ◽  
Genus Formula

A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number [Formula: see text], genus [Formula: see text] and type [Formula: see text]. It is known that for any numerical semigroup [Formula: see text]. Numerical semigroups with [Formula: see text] are called almost symmetric, we introduce a new property that characterizes them. We give an explicit characterization of numerical semigroups with [Formula: see text]. We show that for a fixed [Formula: see text] the number of numerical semigroups with Frobenius number [Formula: see text] and type [Formula: see text] is eventually constant for large [Formula: see text]. The number of numerical semigroups with genus [Formula: see text] and type [Formula: see text] is also eventually constant for large [Formula: see text].

scholarly journals The enumeration of the set of atomic numerical semigroups with fixed Frobenius number

2019 ◽  
Vol 19 (08) ◽  
pp. 2050144
Author(s):  
Aureliano M. Robles-Pérez ◽  
José Carlos Rosales
Keyword(s):  
Numerical Semigroup ◽  
Frobenius Number ◽  
Numerical Semigroups

A numerical semigroup is irreducible if it cannot be obtained as an 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 numerical semigroup. Based on a previous one developed to obtain all irreducible numerical semigroups with a fixed Frobenius number, we present an algorithm for computing all atomic numerical semigroups with a fixed Frobenius number.

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].

OPENED MODULAR NUMERICAL SEMIGROUPS WITH A GIVEN MULTIPLICITY

2009 ◽  
Vol 19 (02) ◽  
pp. 235-246 ◽  
Author(s):  
J. C. ROSALES ◽  
P. VASCO
Keyword(s):  
Numerical Semigroup ◽  
Rational Numbers ◽  
Frobenius Number ◽  
Numerical Semigroups

Let ℕ be the set of nonnegative integers and let I be an interval of positive rational numbers. Then [Formula: see text] is a numerical semigroup. In this paper we study the multiplicity of the numerical semigroups of the form [Formula: see text], where a and b are integers such that 2 ≤ a < b. We also see the connection between the multiplicity and the Frobenius number of this type of semigroups.

scholarly journals The genus, Frobenius number and pseudo-Frobenius numbers of numerical semigroups of type 2

2016 ◽  
Vol 146 (5) ◽  
pp. 1081-1090
Author(s):  
Aureliano M. Robles-Pérez ◽  
José Carlos Rosales
Keyword(s):  
Numerical Semigroup ◽  
Sufficient Conditions ◽  
Frobenius Number ◽  
The Other ◽  
Numerical Semigroups ◽  
Frobenius Numbers ◽  
The One ◽  
Necessary And Sufficient ◽  
Positive Integers

We study some questions on numerical semigroups of type 2. On the one hand, we investigate the relation between the genus and the Frobenius number. On the other hand, for two fixed positive integers g1, g2, we give necessary and sufficient conditions in order to have a numerical semigroup S such that {g1, g2} is the set of its pseudo-Frobenius numbers and, moreover, we explicitly build families of such numerical semigroups.

scholarly journals The Frobenius number in the set of numerical semigroups with fixed multiplicity and genus

2017 ◽  
Vol 13 (04) ◽  
pp. 1003-1011
Author(s):  
Aureliano M. Robles-Pérez ◽  
José Carlos Rosales
Keyword(s):  
Numerical Semigroup ◽  
Frobenius Number ◽  
Numerical Semigroups

We compute all possible numbers that are the Frobenius number of a numerical semigroup when multiplicity and genus are fixed. Moreover, we construct explicitly numerical semigroups in each case.

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).

COUNTING NUMERICAL SEMIGROUPS WITH SHORT GENERATING FUNCTIONS

2011 ◽  
Vol 21 (07) ◽  
pp. 1217-1235 ◽  
Author(s):  
VÍCTOR BLANCO ◽  
PEDRO A. GARCÍA-SÁNCHEZ ◽  
JUSTO PUERTO
Keyword(s):  
Generating Function ◽  
Polynomial Time ◽  
Generating Functions ◽  
Time Complexity ◽  
Frobenius Number ◽  
Numerical Semigroups ◽  
Polynomial Time Complexity ◽  
Theoretical Results

This paper presents a new methodology to compute 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 number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting these semigroups. We also illustrate the methodology analyzing the cases of multiplicity 3 and 4 where some formulas for the number of numerical semigroups for any genus and Frobenius number are obtained.

Sign in / Sign up

Export Citation Format

Share Document