BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Institute of Mathematics and Informatics - ECPv6.0.8//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Institute of Mathematics and Informatics
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:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20211031T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20220327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20221030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20230326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20231029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20240331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20241027T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20241121T080000
DTEND;TZID=Europe/Sofia:20241124T170000
DTSTAMP:20260405T062805
CREATED:20241021T082146Z
LAST-MODIFIED:20241021T082557Z
UID:16927-1732176000-1732467600@math.bas.bg
SUMMARY:Национален семинар по теория на кодирането "Проф. Стефан Додунеков"
DESCRIPTION:Националният семинар с международно участие по Теория на кодирането “Професор Стефан Додунеков” за 2024 г. ще се проведе от 21 до 24 ноември в парк-хотел „Севастократор”\, с. Арбанаси. \nНаучната програма ще се проведе на 22 и 23 ноември и включва доклади (до 20 минути)\, представяния на дисертации (до 40 минути) и дискусии. \nЗа участие в научната програма моля изпратете заглавие и кратък абстракт (до една страница) на чл.-кор. Петър Бойваленков\, peter@math.bas.bg и проф. Цонка Байчева\, tsonka@math.bas.bg най-късно до 11 ноември 2024 г. \nСеминарът е и отчетна сесия на секция Математически основи на информатиката към ИМИ-БАН.
URL:https://math.bas.bg/event/nacionalen-seminar-moi-2024/
LOCATION:Парк-хотел “Севастократор\, с. Арбанаси
CATEGORIES:Редовен семинар
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20210302T130000
DTEND;TZID=Europe/Sofia:20210302T143000
DTSTAMP:20260405T062805
CREATED:20210228T195213Z
LAST-MODIFIED:20210228T195213Z
UID:10215-1614690000-1614695400@math.bas.bg
SUMMARY:Семинар “Problems and Methods Related to Coding Theory“
DESCRIPTION:Семинарът  \nProblems and Methods Related to Coding Theory\nОрганизиран от \nИМИ – БАН\, Секция “Математически основи на информатиката”\, \n Novosibirsk State University\, Novosibirsk\, Russia\, и \n Sobolev Institute of Mathematics\, Siberian Branch of  the Russian Academy of Sciences\, Novosibirsk\, Russia \nВи кани на поредната си сбирка\, която ще се проведе онлайн на 02 март 2021 г. от 13:00 часа. \nПетър Бойваленков\, ИМИ-БАН\,\nще изнесе доклад на тема: \nUniversal Bounds for Cardinality and Energy of Codes of Given Minimum and Maximum Distances\nAbstract. We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances\, and universal lower bounds on the potential energy (for absolutely monotone interactions) for codes with given maximum distance and cardinality. The distance distributions of codes that attain the bounds are found in terms of the parameters of Levenshtein-type quadrature formulas. Necessary and sufficient conditions for the optimality of our bounds are derived. Further\, we obtain upper bounds on the energy of codes of fixed minimum and maximum distances and cardinality. \nJoint work with Peter Dragnev\, Douglas Hardin\, Edward Saff\, Maya Stoyanova \nСтраница на семинара: http://www.math.bas.bg/moiuser/PMCT/ \nТеТ\nJoin Zoom Meeting \nZoom ID: 910 5863 2644 \nPassword: 12624120 \nhttps://zoom.us/j/91058632644?pwd=Q3FZa29SV0pTUTZ5bEl1WGwyQU8xUT09
URL:https://math.bas.bg/event/%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-problems-and-methods-related-to-coding-theory/
LOCATION:Zoom
CATEGORIES:Работен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20210202T130000
DTEND;TZID=Europe/Sofia:20210202T143000
DTSTAMP:20260405T062805
CREATED:20210129T121142Z
LAST-MODIFIED:20210129T121142Z
UID:9984-1612270800-1612276200@math.bas.bg
SUMMARY:Онлайн семинар: Problems and Methods Related to Coding Theory
DESCRIPTION:В рамките на онлайн семинара \nProblems and Methods Related to Coding Theory\nорганизиран от: \nИнститута по математика и информатика на Българската академия на науките\, \nНовосибирския държавен университет\, Новосибирск\, Русия\, \nИнститута по математика “С. Л. Соболев”\, Сибирски клон на Руската академия на науките\, Новосибирск\, Русия\, \nна 2 февруари 2021 г. от 13:00 ч. (18:00 ч. в Новосибирск\, 14:00 ч. в Москва) \n проф. Сергей Августинович\, Институт по математика “С. Л. Соболев”\, Новосибирск\, Русия\, \nще изнесе доклад на тема: \nСовершенные раскраски циркулянтных графов \n(Perfect colorings of circulant graphs).\nРезюме: A Cayley graph of the infinite cyclic group having generators d1\, d2\, d3\, …\, dn is called circulant. It is denoted by С∞(d1\, d2\, d3\, …\, dn). A coloring of the vertex set of a graph is called perfect if for any colors i and j and any vertex x of color i\, the number of its neighbors of color j depends only on i and j. It is well known that any perfect coloring of an infinite circulant graph is periodic. \nThere is a natural homomorphism from the n-dimensional lattice into an arbitrary  circulant graph with n distances. In particular\, this рmeans that every perfect coloring of a circulant graph with n distances induces a perfect coloring of an n-dimensional rectangular lattice with the same parameters. In the talk some constructions of colorings and open questions will be considered. \n  \nTime: Feb 2\, 2021\, 13:00 Sofia (18:00 Novosibirsk\, 14:00 Moscow) \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/81418728292?pwd=UUxURWRzMThxQXZrcXpBT0Z5MDlmQT09 \nMeeting ID: 814 1872 8292\nPasscode: 471759\nOne tap mobile\n+35924925688\,\,81418728292#\,\,\,\,*471759# Bulgaria\n+35932571633\,\,81418728292#\,\,\,\,*471759# Bulgaria \nDial by your location\n+359 2 492 5688 Bulgaria\n+359 3 257 1633 Bulgaria\n+7 495 283 9788 Russian Federation\n+7 499 951 6379 Russian Federation\n+7 499 951 6380 Russian Federation\n+7 812 426 8988 Russian Federation\nMeeting ID: 814 1872 8292\nPasscode: 471759\nFind your local number: https://us02web.zoom.us/u/kSrbG9xyj
URL:https://math.bas.bg/event/%d0%be%d0%bd%d0%bb%d0%b0%d0%b9%d0%bd-%d1%81%d0%b5%d0%bc%d0%b8%d0%bd%d0%b0%d1%80-problems-and-methods-related-to-coding-theory/
LOCATION:Zoom
CATEGORIES:Лекция,Работен семинар
ORGANIZER;CN="%D0%98%D0%BD%D1%81%D1%82%D0%B8%D1%82%D1%83%D1%82%20%D0%BF%D0%BE%20%D0%BC%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20%D0%B8%20%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0%20-%20%D0%91%D0%90%D0%9D":MAILTO:office@math.bas.bg
END:VEVENT
END:VCALENDAR