Gapsets and numerical semigroups
From MaRDI portal
Publication:2010627
Abstract: For g 0, let n g denote the number of numerical semi-groups of genus g. A conjecture by Maria Bras-Amor'os in 2008 states that the inequality n g n g--1 + n g--2 should hold for all g 2. Here we show that such an inequality holds for the very large subtree of numerical semigroups satisfying c 3m, where c and m are the conductor and multiplicity, respectively. Our proof is given in the more flexible setting of gapsets, i.e. complements in N of numerical semigroups.
Recommendations
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Distribution of genus among numerical semigroups with fixed Frobenius number
- Numerical semigroups with multiplicity three and four.
- Constructing numerical semigroups of a given genus.
- Fundamental gaps in numerical semigroups.
- A graph-theoretic approach to Wilf's conjecture
- Bounds on the number of numerical semigroups of a given genus
- Degree asymptotics of the numerical semigroup tree.
- Counting numerical semigroups by genus and even gaps
- Improved bounds on the number of numerical semigroups of a given genus
Cites work
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- Bounds on the number of numerical semigroups of a given genus
- Constructing numerical semigroups of a given genus.
- Counting numerical semigroups
- Counting numerical semigroups by genus and some cases of a question of Wilf.
- Exploring the tree of numerical semigroups.
- 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.
- Gapsets of Small Multiplicity
- Near-misses in Wilf's conjecture
- Numerical semigroups.
- On a conjecture by Wilf about the Frobenius number
- On a question of Eliahou and a conjecture of Wilf
- On numerical semigroups
- The oversemigroups of a numerical semigroup.
- Wilf's conjecture and Macaulay's theorem
- numericalsgps, a GAP package for numerical semigroups
Cited in
(23)- On pure \(\kappa\)-sparse gapsets
- On numerical semigroups with almost-maximal genus
- Bounds on the number of numerical semigroups of a given genus
- A generalization of a theorem about gapsets with depth at most 3
- Counting numerical semigroups by genus and even gaps
- Constructing numerical semigroups of a given genus.
- scientific article; zbMATH DE number 6521006 (Why is no real title available?)
- The gap structure of a family of integer subsets
- Counting numerical semigroups by Frobenius number, multiplicity, and depth
- Fibonacci-like growth of numerical semigroups of a given genus.
- On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
- On two-generator Fibonacci numerical semigroups with a prescribed genus
- Almost symmetric numerical semigroups with high type
- Sub-Fibonacci behavior in numerical semigroup enumeration
- Gapsets of Small Multiplicity
- Characterizing Frobenius semigroups by filtration
- On integer partitions corresponding to numerical semigroups
- Gapsets and the $k$-generalized Fibonacci sequences
- Density of numerical sets associated to a numerical semigroup
- A graph-theoretic approach to Wilf's conjecture
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- The right-generators descendant of a numerical semigroup
- Quasi-polynomial growth of numerical and affine semigroups with constrained gaps
Describes a project that uses
Uses Software
This page was built for publication: Gapsets and numerical semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010627)
