Related papers: Counting numerical semigroups by Frobenius number,…
In this work we will introduce the concept of ratio-covariety, as a nonempty family $\mathscr{R}$ of numerical semigroups verifying certain properties. This concept will allow us to: \begin{enumerate} \item Describe an algorithmic process…
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…
A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…
A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…
If $m \in \mathbb{N}$ and $A$ is a finite subset of $\bigcup_{k \in \mathbb{N} \setminus \{0,1\}} \{1,\ldots,m-1\}^k$, then we denote by \begin{align*} \mathscr{C}(m,A) = \left\{S\in \mathscr{S}_m \mid s_1+\cdots+s_k-m \in S \mbox{ if }…
We give an affirmative answer to Wilf's conjecture for numerical semigroups satisfying 2 \nu \geq m, where \nu and m are respectively the embedding dimension and the multiplicity of a semigroup. The conjecture is also proved when m \leq 8…
The main aim of this work is to introduce and justify the study of semi-covarities. A {\it semi-covariety} is a non-empty family $\mathcal{F}$ of numerical semigroups such that it is closed under finite intersections, has a minimum,…
In this paper we study numerical semigroups containing a given positive integer and closed with respect to the action of an affine map. For such semigroups we find a minimal set of generators, their embedding dimension, their genus and…
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
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…
Let $S$ be a numerical semigroup. We will say that $h\in {\mathbb{N}} \backslash S$ is an {\it isolated gap }of $S$ if $\{h-1,h+1\}\subseteq S.$ A numerical semigroup without isolated gaps is called perfect numerical semigroup. Denote by…
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$.
Let a, k, h, c be positive integers and d a non zero integer. Recall that a numerical generalized almost arithmetic semigroup S is a semigroup minimally generated by relatively prime positive integers a, ha + d, ha + 2d, . . . , ha + kd, c,…
Let $S\neq\mathbb N$ be a numerical semigroup with Frobenius number $f$, genus $g$ and embedding dimension $e$. In 1978 Wilf asked the question, whether $\frac{f+1-g}{f+1}\geq\frac1e$. As is well known, this holds in the cases $e=2$ and…
Consider a sequence of positive integers of the form $ca^n-d$, $n\geq 1$, where $a, c$ and $d$ are positive integers, $a>1$. For each $n\geq 1$, let $S_n$ be the submonoid of $\mathbb N$ generated by $\mathbf s_j=ca^{n+j}-d$, with…
A numerical semigroup $S$ is coated with odd elements (Coe-semigroup), if $\left\{x-1, x+1\right\}\subseteq S$ for all odd element $x$ in $S$. In this note, we will study this kind of numerical semigroups. In particular, we are interested…
We generalize and prove a hypothesis by V. Arnold on the parity of Frobenius number. For the case of symmetric semigroups with three generators of Frobenius numbers we found an exact formula, which in a sense is the sum of two Sylvester's…
We present a procedure to enumerate the whole set of numerical semigroups with a given Frobenius number F, S(F). The methodology is based on the construction of a partition of S(F) by a congruence relation. We identify exactly one…
We find a relation between the genus of a quotient of a numerical semigroup $S$ and the genus of $S$ itself. We use this identity to compute the genus of a quotient of $S$ when $S$ has embedding dimension $2$. We also exhibit identities…
We develop a geometric procedure for finding the Ap\'ery set of any numerical semigroup with embedding dimension four. Previous methods of comparable strength worked only for embedding dimension three or under very specific conditions. We…