Related papers: Numerical Semigroups Generated by Quadratic Sequen…
We are interested in formulas for the number of elements in certain classes of numerical semigroups
We study the Ap\'ery set of good subsemigoups of $\mathbb N^2$, a class of semigroups containing the value semigroups of curve singularities with two branches. Even if this set in infinite, we show that, for the Ap\'ery set of such…
We establish a one-to-one correspondence between numerical semigroups of genus $g$ and almost symmetric numerical semigroups with Frobenius number $F$ and type $F-2g$, provided that $F$ is greater than $4g-1$.
We give an algorithm to compute the $\omega$-primality of finitely generated atomic monoids. Asymptotic $\w$-primality is also studied and a formula to obtain it in finitely generated quasi-Archimedean monoids is proven. The formulation is…
A numerical semigroup is a subset of N containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
We define a reflective numerical semigroup of genus $g$ as a numerical semigroup that has a certain reflective symmetry when viewed within $\mathbb{Z}$ as an array with $g$ columns. Equivalently, a reflective numerical semigroup has one gap…
Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…
Methods from additive number theory are applied to construct families of finitely generated linear semigroups with intermediate growth.
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 introduce the Frobenius problem for numerical…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
Given three pairwise coprime positive integers $a_1,a_2,a_3 \in \mathbb{Z}^+$ we show the existence of a relation between the sets of the first elements of the three quotients $\frac{\langle a_i,a_j \rangle}{a_k}$ that can be made for every…
For a nonnegative integer $p$, we give explicit formulas for the $p$-Frobenius number and the $p$-genus of generalized Fibonacci numerical semigroups. Here, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose…
We prove that, for each fixed genus, the portion of semigroups of that genus belonging to infinite chains in the semigroup tree approaches 0 as the genus grows to infinite. This means that most numerical semigroups have a finite number of…
A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers, containing zero, with finite complement. Its multiplicity $m$ is its smallest nonzero element. The Apery set of $S$ is the set $\text{Ap}(S) = \{n \in S :…
The catenary degree is an invariant that measures the distance between factorizations of elements within a numerical semigroup. In general, all possible catenary degrees of the elements of the numerical semigroups occur as the catenary…
We study the question whether the affine semigroup of integer points in a convex cone can be finitely generated up to symmetries of the cone. We establish general properties of finite generation up to symmetry, and then concentrate on the…
This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical…
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…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…