Gapsets and numerical semigroups

DOI10.1016/J.JCTA.2019.105129zbMATH Open1456.20064arXiv1811.10295OpenAlexW2900553706MaRDI QIDQ2010627FDOQ2010627

Authors: Shalom Eliahou, Jean Fromentin 

Publication date: 27 November 2019

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: For g $ge$ 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 $ge$ n g--1 + n g--2 should hold for all g $ge$ 2. Here we show that such an inequality holds for the very large subtree of numerical semigroups satisfying c $le$ 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.

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

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

zbMATH Keywords

Fibonacci[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Bras-Amor%EF%BF%BD%EF%BF%BDs+conjectures&go=Go Bras-Amor��s conjectures]gapset filtrationgapsets graphnumerical semigroups treetribonacci

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Commutative semigroups (20M14)

Cites Work

• numericalsgps, a GAP package for numerical semigroups
• Exploring the tree of numerical semigroups.
• Numerical semigroups.
• Bounds on the number of numerical semigroups of a given genus
• Fibonacci-like growth of numerical semigroups of a given genus.
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
• Counting numerical semigroups by genus and some cases of a question of Wilf.
• Title not available (Why is that?)
• On numerical semigroups
• Constructing numerical semigroups of a given genus.
• On a conjecture by Wilf about the Frobenius number
• Fundamental gaps in numerical semigroups.
• Gapsets of Small Multiplicity
• Wilf's conjecture and Macaulay's theorem
• The oversemigroups of a numerical semigroup.
• On a question of Eliahou and a conjecture of Wilf
• Near-misses in Wilf's conjecture
• Counting Numerical Semigroups

Cited In (16)

• Gapsets of Small Multiplicity
• The gap structure of a family of integer subsets
• Almost symmetric numerical semigroups with high type
• Bounds on the number of numerical semigroups of a given genus
• Constructing numerical semigroups of a given genus.
• On pure \(\kappa\)-sparse gapsets
• Sub-Fibonacci behavior in numerical semigroup enumeration
• Title not available (Why is that?)
• The right-generators descendant of a numerical semigroup
• Fibonacci-like growth of numerical semigroups of a given genus.
• Counting numerical semigroups by Frobenius number, multiplicity, and depth
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• Characterizing Frobenius semigroups by filtration
• On the generalized Feng-Rao numbers of numerical semigroups generated by intervals
• A graph-theoretic approach to Wilf's conjecture
• A generalization of a theorem about gapsets with depth at most 3

Uses Software

• numericalsgps
• NumericalSemigroupsWithGenus
• nsgtree
• NumericMonoid

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)