Constructing the set of complete intersection numerical semigroups with a given Frobenius number.

DOI10.1007/S00200-013-0186-ZMaRDI QIDQ360195zbMATHOpenAlexFDO

Authors Abdallah Assi, Pedro A. García Sánchez

Publication date 26 August 2013

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.4258

zbMATH Keywords

algorithmsFrobenius numbersembedding dimensiongeneracomplete intersectionscomplete intersection numerical semigroupsfree numerical semigroupsgluingsmultiplicitiesplane curve singularitiestelescopic numerical semigroups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Complete intersections (14M10) Commutative semigroups (20M14)

Abstract: 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 telescopic numerical semigroups, and numerical semigroups associated to an irreducible plane curve singularity. The recursive nature of this procedure allows us to give bounds for the embedding dimension and for the minimal generators of a semigroup in any of these families.

Recommendations

• On the enumeration of the set of numerical semigroups with fixed Frobenius number.
• The set of numerical semigroups of a given multiplicity and Frobenius number
• The set of numerical semigroups of a given genus.
• Classes of complete intersection numerical semigroups.
• The Frobenius problem for numerical semigroups

Cites work

• scientific article; zbMATH DE number 3950697 (Why is no real title available?)
• scientific article; zbMATH DE number 3336013 (Why is no real title available?)
• scientific article; zbMATH DE number 2229032 (Why is no real title available?)
• A Linear Diophantine Problem
• Affine semigroups having a unique Betti element.
• An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
• Complete intersections in affine monomial curves
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• Fibonacci-like growth of numerical semigroups of a given genus.
• Fundamental gaps in numerical semigroups.
• Numerical semigroups.
• On free affine semigroups
• On numerical semigroups with high embedding dimension
• On presentations of subsemigroups of \(\mathbb{N}^n\)
• Semi-groupes d'entiers et application aux branches
• Sous-monoïdes d'intersection complète de $N$
• The minimum distance of codes in an array coming from telescopic semigroups
• numericalsgps, a GAP package for numerical semigroups

Cited in

(9)

• On Frobenius numbers for symmetric (not complete intersection) semigroups generated by four elements
• Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\)
• Frobenius vectors, Hilbert series and gluings of affine semigroups.
• The second Feng-Rao number for codes coming from telescopic semigroups
• Universally free numerical semigroups
• On robustness and related properties on toric ideals
• Constructing 2 × 2 Bricks from Unitary Numerical Semigroups
• numericalsgps, a GAP package for numerical semigroups
• Classes of complete intersection numerical semigroups.

Describes a project that uses

Uses Software

• GAP
• numericalsgps
• NumericalSemigroupsWithGenus
• cisimplicial

This page was built for publication: Constructing the set of complete intersection numerical semigroups with a given Frobenius number.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360195)