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:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Sofia:20250108T170000
DTEND;TZID=Europe/Sofia:20250108T183000
DTSTAMP:20260419T082900
CREATED:20250106T202156Z
LAST-MODIFIED:20250106T202156Z
UID:17185-1736355600-1736361000@math.bas.bg
SUMMARY:Семинар на секция "Математически основи на информатиката"
DESCRIPTION:Семинарът по \nМАТЕМАТИЧЕСКИ ОСНОВИ НА ИНФОРМАТИКАТА \nорганизиран от \nСекция „Математически основи на информатиката“ към ИМИ – БАН и \nФакултет „Математика и информатика“ – ВТУ\, \nВи кани на поредната сбирка на 8 януари 2025 г. от 17:00 часа в зала 401 на корпус 4 на ВТУ\, на която \nProf. Ferruh Özbudak\nSabancı University\nFaculty of Engineering and Natural Sciences\,\nİstanbul – Turkiye\nще изнесе доклад на тема: \nGeneralizing the Bierbrauer—Friedman bound to mixed-level orthogonal arrays\n(joint work with Denis Krotov and Vladimir Potapov) \nAbstract: We characterize mixed-level orthogonal arrays it terms of algebraic designs in a special multigraph. We prove a mixed-level analog of the Bierbrauer–Friedman (BF) bound for pure-level orthogonal arrays and show that arrays attaining it are radius-1 completely regular codes (equivalently\, intriguing sets\, equitable 2-partitions\, perfect 2-colorings) in the corresponding multigraph. For the case when the numbers of levels are powers of the same prime number\, we characterize\, in terms of multispreads\, additive mixed-level orthogonal arrays attaining the BF bound. For pure-level orthogonal arrays\, we consider versions of the BF bound obtained by replacing the Hamming graph by its polynomial generalization and show that in some cases this gives a new bound. \nAcknowledgment: The work of F.Ö. was supported by TÜBİTAK under Grant 223N065. \nЗа тези\, които няма да могат да дойдат\, предлагаме да се включат онлайн през\n\nMicrosoft Teams Имате ли нужда от помощ?\n\n\nПрисъединете се към събранието сега\n\n\nИД на събрание: 363 497 232 460\n\n\nПарола: bF93pw6a
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-23/
LOCATION:Великотърновски университет\, ул. "Теодосий Търновски" № 2\, Велико Търново\, 5005\, Bulgaria
CATEGORIES:Редовен семинар
END:VEVENT
END:VCALENDAR