A graph-theoretic approach to Wilf's conjecture

DOI10.37236/9106zbMath1455.11046arXiv1909.03699OpenAlexW3021293132WikidataQ122964447 ScholiaQ122964447MaRDI QIDQ2182002

Shalom Eliahou

Publication date: 20 May 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

numerical semigroupFrobenius number

Mathematics Subject Classification ID

Commutative semigroups (20M14) Graph theory (05C99) Linear Diophantine equations (11D04)

Related Items (4)

A new face iterator for polyhedra and for more general finite locally branched lattices ⋮ Bounds for invariants of numerical semigroups and Wilf's conjecture ⋮ Wilf’s conjecture for numerical semigroups with large second generator ⋮ On numerical semigroups with at most 12 left elements

Uses Software

• numericalsgps
• nsgtree
• NumericMonoid

Cites Work

• Unnamed Item
• Unnamed Item
• Counting numerical semigroups by genus and some cases of a question of Wilf.
• Near-misses in Wilf's conjecture
• Numerical semigroups.
• On a question of Eliahou and a conjecture of Wilf
• Wilf's conjecture and Macaulay's theorem
• Numerical semigroups with large embedding dimension satisfy Wilf's conjecture.
• Gapsets and numerical semigroups
• On a conjecture by Wilf about the Frobenius number
• The proportion of Weierstrass semigroups
• Fibonacci-like behavior of the number of numerical semigroups of a given genus.
• Exploring the tree of numerical semigroups
• Wilf’s conjecture in fixed multiplicity
• A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
• On numerical semigroups

This page was built for publication: A graph-theoretic approach to Wilf's conjecture