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

DOI10.1007/S00200-013-0186-ZMaRDI QIDQ360195zbMATH OpenOpenAlexFDO

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

algorithmscomplete intersection numerical semigroupscomplete intersectionsembedding dimensionfree numerical semigroupsFrobenius numbersgeneragluingsmultiplicitiesplane curve singularitiestelescopic numerical semigroups

Mathematics Subject Classification ID

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

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.

Review text

A numerical semigroup \(\Gamma\) is a cofinite submonoid of \((\mathbb N,+)\). We call such a semigroup a complete intersection if the ring \(\Bbbkt^n:n\in\Gamma\) is a complete intersection. For a numerical semigroup \(\Gamma\) we define the Frobenius number \(f(\Gamma)=\max(\mathbb Z\setminus\Gamma)\), the multiplicity \(m(\Gamma)=\min(\Gamma\setminus\{0\})\), the genus \(g(\Gamma)=|\mathbb N\setminus\Gamma|\) and the embedding dimension \(e(\Gamma)\) as the number of minimal generators. The gluing of two semigroups \(\Gamma_1\) and \(\Gamma_2\), introduced first by \textit{C. Delorme} [Ann. Sci. Éc. Norm. Supér. (4) 9, 145-154 (1976; Zbl 0325.20065)] with a different terminology, is an operation that yields a semigroup \(\Gamma\) with \(e(\Gamma)=e(\Gamma_1)+e(\Gamma_2)\) and preserves several properties. In particular, Delorme showed that the collection of complete intersections can be constructed recursively via gluing. In the paper under review the authors use gluing to provide bounds for \(e(\Gamma)\) and \(m(\Gamma)\) in terms of \(f(\Gamma)\) under the assumption that \(\Gamma\) is a complete intersection. They also present an algorithm to construct the (finite) collection of complete intersections with fixed Frobenius number. Then the authors focus their attention on certain subclasses of the complete intersections, namely free and telescopic numerical semigroups and semigroups associated to singularities of irreducible plane curves. For each of these classes, some inequalities involving the generators of \(\Gamma\) are proved, allowing improved versions of the algorithm mentioned above. The authors conclude the paper by presenting some experimental results obtained by implementing the algorithms in \texttt{GAP}. More specifically, they provide data on the asymptotic behavior of the proportion of complete intersections (and the other classes) in the set of semigroups with fixed genus, as the genus increases. These computations suggest that most complete intersections are free.

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

• 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.
• 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?)
• Numerical semigroups.
• numericalsgps, a GAP package for 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

Cited in

(10)

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

Describes a project that uses

Uses Software

• GAP
• NumericalSemigroupsWithGenus
• numericalsgps
• 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)