На 05.07.2022г. oт 14:00 в заседателната зала на ИМИ-БАН ще се състои сбирка на семинара на секция „Математически основи на информатиката“. Докладчик ще бъде проф. Александър Барг от Университета на Мериленд. Той ще изнесе доклад на тема Remarks on the 1st linear programming bound for binary codes Abstract: The "linear programming bound" on the rate of binary codes (1977) is a fundamental result in coding theory that continues to attract attention to this day, with new proofs appearing every now and then. I will discuss 2 proofs from about 2006-08, appearing in arXiv:cs/0512025 (Barg-Nogin) and arXiv:math/0702425 (Navon and Samorodnitsky). Both proofs are based on Fourier analytic arguments on the Boolean cube and exhibit interesting parallels and differences (none of them actually uses linear programming). […]

На 29 юли 2022 г. (петък) от 13:00 ч. ще се проведе дистанционно заседание на семинара по „Алгебра и логика”. Доклад на тема: Modal Descriptive Complexity ще изнесе Петър Илиев (ИФС-БАН и ИМИ-БАН). Абстракт. The study of the descriptive complexity of a class of structures S relative to a class of formulae F from a logic L revolves around the question: what can we say about the definability of S with formulae from F? For example, we might want to know whether there is a formula from F defining S or, if not, whether there is a countably infinite sequence of F-formulae such that each formula from the sequence defines a subset of S and the union of all these subsets is the whole […]