A graph-theoretic approach to Wilf's conjecture

DOI10.37236/9106zbMATH Open1455.11046arXiv1909.03699OpenAlexW3021293132WikidataQ122964447 ScholiaQ122964447MaRDI QIDQ2182002FDOQ2182002

Shalom Eliahou

Publication date: 20 May 2020

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

Abstract: Let S $subseteq$ N be a numerical semigroup with multiplicity m = min(S {0}) and conductor c = max(N S) + 1. Let P be the set of primitive elements of S, and let L be the set of elements of S which are smaller than c. A longstand-ing open question by Wilf in 1978 asks whether the inequality |P||L| $ge$ c always holds. Among many partial results, Wilf's conjecture has been shown to hold in case |P| $ge$ m/2 by Sammartano in 2012. Using graph theory in an essential way, we extend the verification of Wilf's conjecture to the case |P| $ge$ m/3. This case covers more than 99.999% of numerical semigroups of genus g $le$ 45.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Frobenius numbernumerical semigroup

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Exploring the tree of numerical semigroups.
• Numerical semigroups.
• 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.
• On numerical semigroups
• On a conjecture by Wilf about the Frobenius number
• Gapsets and numerical semigroups
• Wilf's conjecture and Macaulay's theorem
• Numerical semigroups with large embedding dimension satisfy Wilf's conjecture.
• On a question of Eliahou and a conjecture of Wilf
• Near-misses in Wilf's conjecture
• The proportion of Weierstrass semigroups
• Wilf’s conjecture in fixed multiplicity

Cited In (9)

• Wilf’s conjecture for numerical semigroups with large second generator
• Fine-Wilf graphs and the generalized Fine-Wilf theorem
• On numerical semigroups with at most 12 left elements
• Gapsets and numerical semigroups
• Bounds for invariants of numerical semigroups and Wilf's conjecture
• A new face iterator for polyhedra and for more general finite locally branched lattices
• A finiteness theorem for W-graphs
• The expected embedding dimension, type and weight of a numerical semigroup
• A verification of Wilf's conjecture up to genus \(100\)

Uses Software

• numericalsgps
• nsgtree
• NumericMonoid

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182002)