BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Oleh Vynnyshyn (Institute of Mathematics\, Natl. Acad. Sci. Ukrain
 e)
DTSTART:20241121T133000Z
DTEND:20241121T150000Z
DTSTAMP:20260423T005733Z
UID:fran/56
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/fran/56/">Th
 e size of minimal control sets for binary representation of numbers of int
 erval $[0\, 1]$</a>\nby Oleh Vynnyshyn (Institute of Mathematics\, Natl. A
 cad. Sci. Ukraine) as part of Семінар з фрактального 
 аналізу / Fractal analysis seminar\n\n\nAbstract\nIn the talk\, we 
 discuss sets defined by some representation of numbers with an alphabet $A
 $ (for example\, $s$-adic numeral system) and with the set of deleted comb
 inations of symbols. The problem about a minimal number of deleted combina
 tions of the length $n$ that result in degeneration of a set is studied in
  detail.\n
LOCATION:https://researchseminars.org/talk/fran/56/
END:VEVENT
END:VCALENDAR