Wilf’s conjecture in fixed multiplicity
2020 ◽
Vol 30
(04)
◽
pp. 861-882
Keyword(s):
We give an algorithm to determine whether Wilf’s conjecture holds for all numerical semigroups with a given multiplicity [Formula: see text], and use it to prove Wilf’s conjecture holds whenever [Formula: see text]. Our algorithm utilizes techniques from polyhedral geometry, and includes a parallelizable algorithm for enumerating the faces of any polyhedral cone up to orbits of an automorphism group. We also introduce a new method of verifying Wilf’s conjecture via a combinatorially flavored game played on the elements of a certain finite poset.
2020 ◽
Vol 13
(08)
◽
pp. 2050159
1968 ◽
Vol 26
◽
pp. 98-99
Keyword(s):
1997 ◽
Vol 103
(1)
◽
pp. 219
2008 ◽
Vol 2008
◽
pp. 19-21
Keyword(s):