BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20260101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20260605
DTEND;VALUE=DATE:20260609
DTSTAMP:20260609T053303
CREATED:20260526T112256Z
LAST-MODIFIED:20260526T112416Z
UID:8615-1780617600-1780963199@aarms.math.ca
SUMMARY:Combinatorial Design Theory session at Summer 2026 CMS Meeting
DESCRIPTION:Combinatorial design theory studies the existence\, construction\, and structure of finite sets such as subsets\, arrays\, and graphs\, that satisfy constraints. Leonard Euler investigated pairs of orthogonal Latin squares in the 18th century\, and design theory’s origin predates this with a magic square found on a turtle’s back in China around 2200 BC. In the 20th century\, Statisticians used Balanced Incomplete Block Designs\, and connections with algebra and finite geometry opened new directions in the field. In the late 20th century\, computational approaches marked a new era in design theory. Today design theory is multidisciplinary\, studying factorization problems and combinatorial arrays with applications that include algorithm design\, cryptography\, wireless communication\, and coding theory. Canada is home to a growing strong and internationally recognized research community. This session aims to bring together researchers from diverse subareas of design theory to the CMS to discuss advances in the field. \nContact:  Brett Stevens  brett@math.carleton.ca
URL:https://aarms.math.ca/event/combinatorial-design-theory-session-at-summer-2026-cms-meeting/
CATEGORIES:AARMS sponsored events
END:VEVENT
END:VCALENDAR