Bounds for invariants of numerical semigroups and Wilf's conjecture

Abstract: Given coprime positive integers

g_{1} < l d o t s < g_{e}

, the Frobenius number

F = F (g_{1}, l d o t s, g_{e})

is the largest integer not representable as a linear combination of

g_{1}, l d o t s, g_{e}

with non-negative integer coefficients. Let

n

denote the number of all representable non-negative integers less than

F

; Wilf conjectured that

F + 1 l e e n

. We provide bounds for

g_{1}

and for the type of the numerical semigroup

S = l a n g l e g_{1}, l d o t s, g_{e} a n g l e

in function of

e

and

n

, and use these bounds to prove that

F + 1 l e q e n

, where

q = l e f t l c e i l f r a c F + 1 g_{1} i g h t c e i l

, and

F + 1 l e e n^{2}

. Finally, we give an alternative, simpler proof for the Wilf conjecture if the numerical semigroup

S = l a n g l e g_{1}, l d o t s, g_{e} a n g l e

is almost-symmetric.

Recommendations

Cites Work

Cited In (7)

This page was built for publication: Bounds for invariants of numerical semigroups and Wilf's conjecture