BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Shalom Eliahou (Universit\\' e du Littoral C\\^ ote d'Opale\,  Fra
 nce)
DTSTART:20200605T140000Z
DTEND:20200605T142500Z
DTSTAMP:20260423T011223Z
UID:CANT2020/59
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2020/59/
 ">Some recent results on Wilf's conjecture</a>\nby Shalom Eliahou (Univers
 it\\' e du Littoral C\\^ ote d'Opale\,  France) as part of Combinatorial a
 nd additive number theory (CANT 2021)\n\n\nAbstract\nA <i>numerical semigr
 oup</i> is a submonoid  $S$ of the nonnegative integers with finite \ncomp
 lement. Its \\emph{conductor} is the smallest integer $c \\ge 0$ such that
  $S$ contains \nall integers $z \\ge c$\, and its \\emph{left part} $L$ is
  the set of all $s \\in S$ such that $s < c$. \nIn 1978\, Wilf asked wheth
 er the inequality $n|L| \\ge c$ always holds\, where $n$ is the least \nnu
 mber of generators of $S$. This is now known as Wilf's conjecture. \nIn th
 is talk\, we present some recent results towards it\, using tools from com
 mutative algebra \nand graph theory.\n
LOCATION:https://researchseminars.org/talk/CANT2020/59/
END:VEVENT
END:VCALENDAR