Numerical semigroups with large embedding dimension satisfy Wilf's conjecture.
From MaRDI portal
Publication:1939494
DOI10.1007/s00233-011-9370-2zbMath1263.20058arXiv1111.1863OpenAlexW1976913230WikidataQ123139105 ScholiaQ123139105MaRDI QIDQ1939494
Publication date: 4 March 2013
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.1863
typesconductorsmultiplicitiesnumerical semigroupsgeneraFrobenius numbersembedding dimensionApéry setsWilf conjecture
Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) The Frobenius problem (11D07)
Related Items
Frobenius R-variety of the numerical semigroups contained in a given one ⋮ Counting Numerical Semigroups ⋮ A graph-theoretic approach to Wilf's conjecture ⋮ Eliahou number, Wilf function and concentration of a numerical semigroup ⋮ A generalization of Wilf's conjecture for generalized numerical semigroups ⋮ Conjecture of Wilf: A Survey ⋮ Wilf’s conjecture in fixed multiplicity ⋮ Dilatations of numerical semigroups ⋮ Near-misses in Wilf's conjecture ⋮ Unnamed Item ⋮ On the deviation and the type of certain local Cohen-Macaulay rings and numerical semigroups ⋮ Wilf’s conjecture for numerical semigroups with large second generator ⋮ The tree of good semigroups in \(\mathbb{N}^2\) and a generalization of the Wilf conjecture ⋮ Wilf's conjecture for numerical semigroups ⋮ On numerical semigroups with at most 12 left elements ⋮ On a conjecture by Wilf about the Frobenius number
Cites Work
- Numerical semigroups.
- Fibonacci-like behavior of the number of numerical semigroups of a given genus.
- Goto Numbers of a Numerical Semigroup Ring and the Gorensteiness of Associated Graded Rings
- A Circle-Of-Lights Algorithm for the "Money-Changing Problem"
- On numerical semigroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item