BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200324T163000
DTEND;TZID=Asia/Seoul:20200324T173000
DTSTAMP:20260420T115019
CREATED:20200311T074415Z
LAST-MODIFIED:20240707T084154Z
UID:2186-1585067400-1585071000@dimag.ibs.re.kr
SUMMARY:Kevin Hendrey\, Covering radius in the Hamming permutation space
DESCRIPTION:Our problem can be described in terms of a two player game\, played with the set $\mathcal{S}_n$ of permutations on $\{1\,2\,\dots\,n\}$. First\, Player 1 selects a subset $S$ of $\mathcal{S}_n$ and shows it to Player 2. Next\, Player 2 selects a permutation $p$ from $\mathcal{S}_n$ as different as possible from the permutations in $S$\, and shows it to Player 1. Finally\, Player 1 selects a permutation $q$ from $S$\, and they compare $p$ and $q$. The aim of Player 1 is to ensure that $p$ and $q$ differ in few positions\, while keeping the size of $S$ small. The function $f(n\,s)$ can be defined as the minimum size of a set $S\subseteq \mathcal{S}_n$ that Player 1 can select in order to gaurantee that $p$ and $q$ will differ in at most $s$ positions. \nI will present some recent results on the function $f(n\,s)$. We are particularly interested in determining the value $f(n\,2)$\, which would resolve a conjecture of Kézdy and Snevily that implies several famous conjectures for Latin squares. Here we improve the best known lower bound\, showing that $f(n\,2)\geqslant 3n/4$. This talk is based on joint work with Ian M. Wanless.
URL:https://dimag.ibs.re.kr/event/2020-03-24/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR