Constructing the set of complete intersection numerical semigroups with a given Frobenius number.
DOI10.1007/s00200-013-0186-zzbMath1282.20064arXiv1204.4258OpenAlexW1974171366MaRDI QIDQ360195
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
algorithmscomplete intersectionsmultiplicitiesgeneraFrobenius numbersembedding dimensionfree numerical semigroupscomplete intersection numerical semigroupsgluingsplane curve singularitiestelescopic numerical semigroups
Symbolic computation and algebraic computation (68W30) Commutative semigroups (20M14) Complete intersections (14M10)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical semigroups.
- Semi-groupes d'entiers et application aux branches
- On numerical semigroups with high embedding dimension
- On free affine semigroups
- On presentations of subsemigroups of \(\mathbb{N}^n\)
- Fundamental gaps in numerical semigroups.
- Fibonacci-like growth of numerical semigroups of a given genus.
- An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Complete intersections in affine monomial curves
- A Linear Diophantine Problem
- Sous-monoïdes d'intersection complète de $N$
- The minimum distance of codes in an array coming from telescopic semigroups
- AFFINE SEMIGROUPS HAVING A UNIQUE BETTI ELEMENT
- numericalsgps, a GAP package for numerical semigroups
This page was built for publication: Constructing the set of complete intersection numerical semigroups with a given Frobenius number.