Related papers: Certified algorithms for numerical semigroups in R…
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…
Good semigroups form a class of submonoids of $\mathbb{N}^d$ containing the value semigroups of curve singularities. In this article, we describe a partition of the complements of good semigroup ideals, having as main application the…
In this paper we present a new algorithm to calculate the set of Arf numerical semigroups with given conductor. Moreover, we extend the previous problem to the class of good semigroups, presenting procedures to compute the set of the Arf…
In this paper, we carry out a fairly comprehensive study of two special classes of numerical semigroups, one generated by the sequence of partial sums of an arithmetic progression and the other one generated by the partial sums of a…
Let $C\subset\mathbb{N}^p$ be an integer polyhedral cone. An affine semigroup $S\subset C$ is a $ C$-semigroup if $| C\setminus S|<+\infty$. This structure has always been studied using a monomial order. The main issue is that the choice of…
We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
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 paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…
We examine two natural operations to create numerical semigroups. We say that a numerical semigroup $\mathcal{S}$ is $k$-normalescent if it is the projection of the set of integer points in a $k$-dimensional polyhedral cone, and we say that…
The well-known expansion of rational integers in an arbitrary integer base different from $0, 1, -1$ is exploited to study relations between numerical monoids and certain subsemigroups of the multiplicative semigroup of nonzero integers.
We study almost symmetric numerical semigroups and semigroup rings. We describe a characteristic property of the minimal free resolution of the semigroup ring of an almost symmetric numerical semigroup. For almost symmetric semigroups…
Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…
For a reduced one-dimensional complete local $k$-algebra $R$, Huneke et al. (Res. Math. Sci., 8(4), paper no. 60, 2021) introduced an important invariant, the reduced type. In this article, we study the extremal behavior of reduced type of…
In this paper we introduce the new concepts of supersymmetric and self-symmetric gaps of a numerical semigroup with two generators. Those concepts are based on certain symmetries of the gaps of the semigroup with respect to their Wilf…
We consider a novel group testing procedure, termed semi-quantitative group testing, motivated by a class of problems arising in genome sequence processing. Semi-quantitative group testing (SQGT) is a non-binary pooling scheme that may be…
Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…
In this paper we introduce the concept of corner element of a generalized numerical semigroup, which extends in a sense the idea of conductor of a numerical semigroup to generalized numerical semigroups in higher dimensions. We present…
A numerical set $S$ with Frobenius number $g$ is a set of integers with $\min(S) = 0$ and $\max(\Zbb - S)=g$, and its atom monoid is $A(S) = \setpres{n \in \Zbb}{$n+s \in S$ for all $s \in S$}$. Let $\gamma_g$ be the number of numerical…
Arithmetical invariants---such as sets of lengths, catenary and tame degrees---describe the non-uniqueness of factorizations in atomic monoids. We study these arithmetical invariants by the monoid of relations and by presentations of the…