BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Institute of Mathematics and Informatics - ECPv6.0.8//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://math.bas.bg
X-WR-CALDESC:Събития за Institute of Mathematics and Informatics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Sofia
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20231029T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20231031T160000
DTEND;TZID=Europe/Sofia:20231031T173000
DTSTAMP:20260404T221145
CREATED:20231026T165751Z
LAST-MODIFIED:20231026T165751Z
UID:15291-1698768000-1698773400@math.bas.bg
SUMMARY:Семинар на секция "Математически основи на информатиката"
DESCRIPTION:На 31 октомври 2023 г. (вторник) от 16:00 часа в зала 578 на ИМИ-БАН\nще се проведе заседание на семинара на секция\n„Математически основи на информатиката”. \nДоклад ще изнесе д-р Константин Воробьов (ИМИ – БАН). \nАбстракт. In this work\, we consider the problem of determining the exact value of \(A_2(n\, {d\, d+2})\) defined as the maximal cardinality of a binary code of length \(n\) with two possible distances \(d\) and \(d+2\). We prove that for fixed even \(d\) and \(n\) big enough\, an optimal code must be a constant-weight code of weight \(d/2+1\) with possibly no more than one additional codeword of a different weight.\nWe also find exact values \(A_2(n\, {4\, 6})\) and \(A_2(n\, {6\, 8})\) starting from some \(n\). \nThis is a joint work with Ivan Landjev. \n 
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-%d0%bd%d0%b0-%d1%81%d0%b5%d0%ba%d1%86%d0%b8%d1%8f-%d0%bc%d0%b0%d1%82%d0%b5%d0%bc%d0%b0%d1%82%d0%b8%d1%87%d0%b5%d1%81%d0%ba%d0%b8-%d0%be%d1%81%d0%bd%d0%be-19/
LOCATION:Институт по математика и информатика – БАН\, Block 8\, 1113 БАН IV км.\, София\, Bulgaria
CATEGORIES:Редовен семинар
END:VEVENT
END:VCALENDAR