Related papers: Parametrizing Arf numerical semigroups
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…
In this paper we present the notion of arithmetic variety for numerical semigroups. We study various aspects related to these varieties such as the smallest arithmetic that contains a set of numerical semigroups and we exhibit the root…
We study statistical properties of random numerical semigroups of a given genus. We analyze the graph of a typical numerical semigroup, understood as a function from $\mathbb{N}$ to $\mathbb{N}$. If $S$ is a numerical semigroup of genus…
This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
We study topological aspects of the category of abstract Cuntz semigroups, termed Cu. We provide a suitable setting in which we are able to uniformly control how to approach an element of a Cu-semigroup by a rapidly increasing sequence.…
A simple way of computing the Ap\'ery set of a numerical semigroup (or monoid) with respect to a generator, using Groebner bases, is presented, together with a generalization for affine semigroups. This computation allows us to calculate…
Let $f_1(n), \ldots, f_k(n)$ be polynomial functions of $n$. For fixed $n\in\mathbb{N}$, let $S_n\subseteq \mathbb{N}$ be the numerical semigroup generated by $f_1(n),\ldots,f_k(n)$. As $n$ varies, we show that many invariants of $S_n$ are…
In this note we observe that the Frobenius number and therefore the conductor of a numerical semigroup can be obtained from the maximal socle degree of the quotient of the corresponding semigroup algebra by the ideal generated by the…
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…
In 1990, Backelin showed that the number of numerical semigroups with Frobenius number $f$ approaches $C_i \cdot 2^{f/2}$ for constants $C_0$ and $C_1$ depending on the parity of $f$. In this paper, we generalize this result to semigroups…
For $p>0$ a small parameter, let $\mathcal A \subseteq \mathbb{Z}_{>0}$ be a random subset where each positive integer is included independently with probability $p$. We show that, with high probability (as $p \to 0$), the numerical…
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…
In this paper we analyze the irreducibility of numerical semigroups with multiplicity up to four. Our approach uses the notion of Kunz-coordinates vector of a numerical semigroup recently introduced in (Blanco-Puerto, 2011). With this tool…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…
We conjecture a Fibonacci-like property on the number of numerical semigroups of a given genus. Moreover we conjecture that the associated quotient sequence approaches the golden ratio. The conjecture is motivated by the results on the…
Two algebroid branches are said to be equivalent if they have the same multiplicity sequence. It is known that two algebroid branches $R$ and $T$ are equivalent if and only if their Arf closures, $R'$ and $T'$ have the same value semigroup,…
We present an algorithm to explore various properties of the numerical semigroups with a given maximum primitive. In particular, we count the number of such numerical semigroups and verify that there is no counterexample to Wilf's…
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…