Gapsets and numerical semigroups
From MaRDI portal
Publication:2010627
DOI10.1016/j.jcta.2019.105129zbMath1456.20064arXiv1811.10295OpenAlexW2900553706MaRDI QIDQ2010627
Jean Fromentin, Shalom Eliahou
Publication date: 27 November 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.10295
Related Items (8)
Almost symmetric numerical semigroups with high type ⋮ On pure \(\kappa\)-sparse gapsets ⋮ A graph-theoretic approach to Wilf's conjecture ⋮ A generalization of a theorem about gapsets with depth at most 3 ⋮ Sub-Fibonacci behavior in numerical semigroup enumeration ⋮ Counting numerical semigroups by Frobenius number, multiplicity, and depth ⋮ Gapsets of Small Multiplicity ⋮ The right-generators descendant of a numerical semigroup
Uses Software
Cites Work
- Unnamed Item
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- Near-misses in Wilf's conjecture
- Constructing numerical semigroups of a given genus.
- Bounds on the number of numerical semigroups of a given genus
- Numerical semigroups.
- The oversemigroups of a numerical semigroup.
- Fundamental gaps in numerical semigroups.
- On a question of Eliahou and a conjecture of Wilf
- Wilf's conjecture and Macaulay's theorem
- Fibonacci-like growth of numerical semigroups of a given genus.
- On a conjecture by Wilf about the Frobenius number
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Exploring the tree of numerical semigroups
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- Counting Numerical Semigroups
- Gapsets of Small Multiplicity
- numericalsgps, a GAP package for numerical semigroups
- On numerical semigroups
This page was built for publication: Gapsets and numerical semigroups
