BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250114T163000
DTEND;TZID=Asia/Seoul:20250114T173000
DTSTAMP:20260417T100151
CREATED:20241226T072931Z
LAST-MODIFIED:20241230T145546Z
UID:10322-1736872200-1736875800@dimag.ibs.re.kr
SUMMARY:Tony Huynh\, The Peaceable Queens Problem
DESCRIPTION:The peaceable queens problem asks to determine the maximum number $a(n)$ such that there is a placement of $a(n)$ white queens and $a(n)$ black queens on an $n \times n$ chessboard so that no queen can capture any queen of the opposite color. \nWe consider the peaceable queens problem and its variant on the toroidal board.  For the regular board\, we show that $a(n) \leq 0.1716n^2$\, for all sufficiently large $n$.  This improves on the bound $a(n) \leq 0.25n^2$ of van Bommel and MacEachern. \nFor the toroidal board\, we provide new upper and lower bounds.  Somewhat surprisingly\, our bounds show that there is a sharp contrast in behaviour between the odd torus and the even torus.  Our lower bounds are given by explicit constructions.  For the upper bounds\, we formulate the problem as a non-linear optimization problem with at most 100 variables\, regardless of the size of the board. We solve our non-linear program exactly using modern optimization software. \nWe also provide a local search algorithm and a software implementation which converges very rapidly to solutions which appear optimal.  Our algorithm is sufficiently robust that it works on both the regular and toroidal boards.  For example\, for the regular board\, the algorithm quickly finds the so-called Ainley construction. \nThis is joint work with Katie Clinch\, Matthew Drescher\, and Abdallah Saffidine.
URL:https://dimag.ibs.re.kr/event/2025-01-14/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR