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:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20210202T130000
DTEND;TZID=Europe/Sofia:20210202T143000
DTSTAMP:20260701T114806
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