Related papers: Counting numerical semigroups by Frobenius number,…
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…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
We are interested in formulas for the number of elements in certain classes of numerical semigroups
One major problem in the study of numerical semigroups is determining the growth of the semigroup tree. In the present work, infinite chains of numerical semigroups in the semigroup tree, firstly introduced by Bras-Amor\'os and Bulygin…
In this paper, we introduce the concept of Arf special gaps of an Arf numerical semigroup, and an algorithm for computing all Arf special gaps of a given Arf numerical semigroup. We introduce the concept of Arf-irreducible numerical…
Let n_g denote the number of numerical semigroups of genus g. Bras-Amoros conjectured that n_g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree.…
The structure of the defining ideal of the semigroup ring $k[H]$ of a numerical semigroup $H$ over a field $k$ is described, when the pseudo-Frobenius numbers of $H$ are multiples of a fixed integer.
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…
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…
A numerical semigroup is a submonoid of $\mathbb N$ with finite complement in $\mathbb N$. A generalized numerical semigroup is a submonoid of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. In the context of numerical…
We derive the polynomial representations for minimal relations of generating set of numerical semigroups R_n^k=<(n-1)^k,n^k,(n+1)^k>, k=2,3,4, n>2. We find also the polynomial representations for degrees of syzygies in the Hilbert series…
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…
We define quasi-Frobenius semigroups and find necessary and sufficient conditions under which a semigroup algebra of a 0-cancellative semigroup is quasi-Frobenius.
A generalized numerical semigroup is a submonoid of $\mathbb{N}^d$ with finite complement in it. In this work we study some properties of three different classes of generalized numerical semigroups. In particular, we prove that the first…
We study numerical semigroups with the property "multiplicity= embedding dimension+1", generated by concatenation of arithmetic sequences.
The paper is dedicated to the study of algebraic manifolds whose quantum cohomology or a part of it is a semisimple Frobenius manifold. Theorem 1.8.1 says, roughly speaking, that the sum of $(p,p)$--cohomology spaces is a maximal Frobenius…
A numerical semigroup $S$ is a cofinite, additively-closed subset of the nonnegative integers that contains $0$. In this paper, we initiate the study of atomic density, an asymptotic measure of the proportion of irreducible elements in a…
In this article, we classify all Buchsbaum simplicial affine semigroups whose complement in their (integer) rational polyhedral cone is finite. We show that such a semigroup is Buchsbaum if and only if its set of gaps is equal to its set of…
De Loera, O'Neill and Wilburne introduced a general model for random numerical semigroups in which each positive integer is chosen independently with some probability p to be a generator, and proved upper and lower bounds on the expected…
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 solve the Frobenius problem for shifted square…