BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20240306T153000
DTEND;TZID=UTC:20240306T163000
DTSTAMP:20260611T220657
CREATED:20240301T112625Z
LAST-MODIFIED:20240301T112625Z
UID:7577-1709739000-1709742600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Induced subgraphs and treewidth\nSpeaker: Sophie Spirkl\, University of Waterloo\nAbstract: Treewidth is a measure of the complexity of a graph and has both structural and algorithmic consequences. While results of Robertson and Seymour characterize which minors appear in graphs of large treewidth\, the same question is still open for induced subgraphs. I will present some recent results towards an answer to this question\, in particular\, about when excluding a finite set of induced subgraphs leads to the answer being “what we expect”. Joint work with Bogdan Alecu\, Maria Chudnovsky\, and Sepehr Hajebi. \n\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547\n\n\nLive viewing with refreshments in Chase 227\, Dalhousie University (bring your own mug for tea.)
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-14/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240304
DTEND;VALUE=DATE:20240305
DTSTAMP:20260611T220657
CREATED:20240202T213320Z
LAST-MODIFIED:20240205T194411Z
UID:7523-1709510400-1709596799@aarms.math.ca
SUMMARY:Acadia Math Buffet
DESCRIPTION:Acadia’s Math Buffets are a chance for students in grades 9- 12 in Hants\, Kings and Annapolis counties to explore new and interactive topics in mathematics. In these 2-hour sessions\, students will learn about a variety of math topics\, such as networks\, Google page rank\, cryptography\, problem solving and how to win at darts.
URL:https://aarms.math.ca/event/acadia-math-buffet/
LOCATION:Acadia University\, Wolfville\, Nova Scotia\, Canada
CATEGORIES:AARMS outreach events
ORGANIZER;CN="Caroline Cochran":MAILTO:caroline.cochran@acadiau.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240229
DTEND;VALUE=DATE:20240301
DTSTAMP:20260611T220657
CREATED:20240202T215603Z
LAST-MODIFIED:20240202T215603Z
UID:7527-1709164800-1709251199@aarms.math.ca
SUMMARY:2024 Integration Competition
DESCRIPTION:The Integration Competition (held 4 times in the past at this university\, funded by AARMS)\, is a head-to-head competition\, in which all first-year calculus students are eligible to compete. Integrals of increasing difficulty are projected\, and two students work head to head\, to solve it first. The winner moves on\, and the other student is eliminated. This process moves through successive rounds until only 2 students are left\, solving a challenging problem in integration. This generates excitement about mathematics among first year students\, aids in recruitment of students to the mathematics major program\, and provides motivation for students to engage more deeply with the curriculum in first-year calculus. This event will also serve as an outreach opportunity to connect first-year students with upper-year students\, and to discuss opportunities available to math students.
URL:https://aarms.math.ca/event/2024-integration-competition/
LOCATION:Saint Francis Xavier University\, 4130 University Avenue\, Antigonish\, Nova Scotia\, B2G 2W5\, Canada
CATEGORIES:AARMS outreach events
ORGANIZER;CN="Ryan Lukeman":MAILTO:rlukeman@stfx.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240228T153000
DTEND;TZID=UTC:20240228T163000
DTSTAMP:20260611T220657
CREATED:20240228T114600Z
LAST-MODIFIED:20240228T114626Z
UID:7574-1709134200-1709137800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Pursuit-evasion on Graphs\nTrent Marbach\, Toronto Metropolitan University \nThe study of pursuit-evasion on graphs looks at games played between two adversaries\, with one player tasked with alluding capture from the other on the graph. We will describe these types of games in general\, although we will take a particular focus on two games: the Cops and Robber game\, and the Localization game. A famous open conjecture for the Cops and Robber game has spurred recent work in the area\, and we show how this work connects to various graph theory topics\, including isoperimetry\, network search\, and width parameters. We will also provide some new applications that have resulted from this work. \nLive viewing at Dalhousie in Chase 227 (bring your own mug for tea). \n——————————\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-13/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240224
DTEND;VALUE=DATE:20240225
DTSTAMP:20260611T220657
CREATED:20240202T124739Z
LAST-MODIFIED:20240202T124739Z
UID:7500-1708732800-1708819199@aarms.math.ca
SUMMARY:Girls STEM Up
DESCRIPTION:Established in 2019\, Girls STEM Up (GSU) has grown into a vibrant community of over members advocating for diversity\, inclusion\, and equity in STEM. Focused on changing perceptions\, GSU hosts an annual conference spotlighting women’s accomplishments in STEM. The event serves as a transformative platform for networking and knowledge exchange\, fueling the passion of young women pursuing STEM careers. The upcoming GSU: Bridging the Gap conference in February 2024 promises to be a pivotal experience. Beyond the conference\, GSU remains committed to year-round engagement in the STEM community\, leaving a meaningful imprint on aspiring girls in STEM through outreach and social media campaigns. With six successful conferences hosting 200+ delegates and 20 speakers\, GSU continues to illuminate multiple paths to success in STEM\, inviting all to join their inspiring journey.
URL:https://aarms.math.ca/event/girls-stem-up-2/
LOCATION:Delta Hotels by Mariott Fredericton\, 225 Woodstock Rd\, Fredericton\, New Brunswick\, Canada
CATEGORIES:AARMS sponsored events
ORGANIZER;CN="Subeksha Adhikari":MAILTO:adhikari.subeksha@gmail.com
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240222T140000
DTEND;TZID=UTC:20240222T170000
DTSTAMP:20260611T220657
CREATED:20240208T120612Z
LAST-MODIFIED:20240208T120612Z
UID:7546-1708610400-1708621200@aarms.math.ca
SUMMARY:AARMS Seminar: EDI in STEM with Dr. Lisa Willis
DESCRIPTION:While EDI has become an often referred to issue in academia and society\, it remains a challenging topic to discuss\, especially for people in STEM fields. Fear of making a mistake or not knowing what to say results in people disengaging from the conversation. Additionally\, the multitude of initiatives and obligations in the EDI space\, few of which seem to be making a real difference\, is leading to EDI fatigue. In this talk\, we will discuss how we as imperfect people can create meaningful sustainable change for ourselves and for the people around us. \nDr. Willis received her B.Sc. in Biochemistry from the University of Victoria and Ph.D. in Molecular and Cellular Biology in the lab of Dr. Chris Whitfield at the University of Guelph. She did her postdoctoral fellowship with Dr. Mark Nitz in the Department of Chemistry at the University of Toronto\, where she received the prestigious Banting Postdoctoral Fellowship. In 2019\, she started as an Assistant Professor in the Department of Biological Sciences at the University of Alberta\, where she is also an Adjunct Professor in the Department of Medical Microbiology and Immunology. She is also the founder of InclusiveSTEM\, a literature-based and data-driven framework for improving the participation and lived experiences of people from marginalized groups in STEM. \n  \nJoin Zoom Meeting \nhttps://us02web.zoom.us/j/83234913058?pwd=SFRHcS9SUGpXT09ueHUzY0h6SFpzdz09 \n  \nMeeting ID: 832 3491 3058 \nPasscode: 721065
URL:https://aarms.math.ca/event/aarms-seminar-edi-in-stem-with-dr-lisa-willis/
LOCATION:manitoba
CATEGORIES:AARMS outreach events
ORGANIZER;CN="David Langstroth":MAILTO:dll@cs.dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240221T153000
DTEND;TZID=UTC:20240221T163000
DTSTAMP:20260611T220657
CREATED:20240219T131416Z
LAST-MODIFIED:20240219T131514Z
UID:7556-1708529400-1708533000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Ada Chan\, York University\nTitle: Polygamy in state transferAbstract:Let $X$ be a graph and $H$ be a Hermitian matrix associated with $X$.   The continuous-time quantum walk with Hamiltonian $H$ isdefined by the time-dependent unitary matrix\begin{equation*}U(t)=e^{i t H}.\end{equation*}Perfect state transfer occurs from vertex $a$ to vertex $b$ at time $\tau$ is $\vert U(\tau)_{b\,a}\vert = 1$.   This phenomenon is relevant for information transmission in a quantum spin network.   For real and symmetric Hamiltonians\, it is known that perfect state transfer can occur from a vertex to at most one other vertex\,mand that graphs with perfect state transfer are rare.    A relaxation\, called pretty good state transfer\, occurs from $a$ to $b$ if $\vert U(\tau)_{b\,a}\vert$ gets arbitrarily close one.  Pal and Bhattacharjya discover a graph with four vertices admitting pairwise pretty good state transfer. In this talk\, we present a family of graphs that admit pairwise pretty good state transfer in an arbitrarily large set of vertices. We compare this polygamous behaviour to walks with Hamiltonians that contain non-real entries.\n\n\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-12/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240214T153000
DTEND;TZID=UTC:20240214T163000
DTSTAMP:20260611T220657
CREATED:20240211T201100Z
LAST-MODIFIED:20240211T201216Z
UID:7549-1707924600-1707928200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Andrew Beveridge\, Macalester College\nTitle: Approval Ballot Triangles\nTime: Wednesday\, February 14\, 3.30pm Atlantic time\nLive viewing for local participants in Chase 227\, Dalhousie University\n \nBertrand’s Ballot Problem enumerates the number of ways to count ballots so that candidate 1 never trails candidate 2. We generalize this problem by considering an approval ballot election between $n$ candidates. In an approval ballot election\, each voter endorses a subset of candidates\, rather than voting for just one person. The general approval ballot problem becomes: how many ways can the ballots be counted so that candidate $k$ never trails candidate $k+1$? This formulation yields a family of binary triangular arrays\, called approval ballot triangles (ABTs)\, that are in bijection with totally symmetric self-complementary plane partitions. We show that ABTs unify three different TSSCPP families of triangular arrays. We then further the connection between TSSCPPs and ballot problems by giving a decomposition of a strict-sense ballot into a list of sequentially compatible ABTs\n \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n \nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-11/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240206T153000
DTEND;TZID=UTC:20240206T163000
DTSTAMP:20260611T220657
CREATED:20240205T201726Z
LAST-MODIFIED:20240205T201815Z
UID:7536-1707233400-1707237000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Zoom link below. Live viewing for local participants in Chase 227 (tea-drinkers are encouraged to bring their own mug).\n \nSpeaker: Evelyn Smith-Roberge\, Georgia Tech\nTitle:Correspondence Packings of Planar Graphs\n \nAbstract: Suppose a graph G has list chromatic number k. It is easy to see that if L is a (k+1)-list assignment for G\, then G admits two L-colourings f and g where f(v) =/= g(v) for every vertex v in the graph. But what if we want still more disjoint L-colourings without making our lists too big? In this talk\, I will discuss recent progress towards determining the list packing number of various classes of planar graphs: that is\, the smallest number k such that if L is a k-list assignment for an arbitrary graph G in the class under study\, then L can be decomposed into k disjoint L-colourings. All results I will discuss also hold in the correspondence colouring framework. Joint work with Daniel Cranston.\n \nJoin ZOOM Meeting:\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-10/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240131T153000
DTEND;TZID=UTC:20240131T163000
DTSTAMP:20260611T220657
CREATED:20240127T122401Z
LAST-MODIFIED:20240127T122513Z
UID:7485-1706715000-1706718600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Thiago de Holleben\, Dalhousie University\nTitle: Homological invariants of graphs with no induced cycles of length divisible by 3\n \nAbstract:  If G is a graph with large chromatic number\, what can we say about its induced subgraphs? In 2014\, Bonamy et al. showed that if a graph has no induced cycles of length divisible by three\, then its chromatic number is bounded. Such graphs are called ternary.\nIn an attempt to better understand the structure of the induced subgraphs of a graph with bounded chromatic number\, Kalai and Meshulam posed questions relating topological invariants of the independence complex\, and the chromatic number of a graph. Since then\, there have been several results bounding chromatic numbers of graphs using topology. In 2022\, Jinha Kim showed a conjecture of Engström stating the exact topological structure of the independence complex of a ternary graph. In this talk\, we describe a graph theoretic way of computing this structure. As an application\, we show that -1 is a root of the independence polynomial of a forest F if and only if the induced matching number of F is not equal to the domination number of F.\n \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-9/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240126
DTEND;VALUE=DATE:20240129
DTSTAMP:20260611T220657
CREATED:20230922T154105Z
LAST-MODIFIED:20230925T101319Z
UID:7318-1706227200-1706486399@aarms.math.ca
SUMMARY:Combinatorial Algebra Meets Algebraic Combinatorics
DESCRIPTION:Combinatorial Algebra Meets Algebraic Combinatorics (CAAC) is a two-day workshop bringing together researchers working at the intersection of combinatorics and algebra. It examines the role of combinatorial structures\, such as permutations\, matroids and polytopes\, arising from problems in Schubert calculus\, commutative algebra\, and other branches of algebra\, representation theory and geometry.
URL:https://aarms.math.ca/event/combinatorial-algebra-meets-algebraic-combinatorics/
LOCATION:Montreal\, Montreal\, Quebec\, Canada
CATEGORIES:AARMS sponsored events
ORGANIZER;CN="Jake Levinson":MAILTO:jake.levinson@umontreal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240124T153000
DTEND;TZID=UTC:20240124T163000
DTSTAMP:20260611T220657
CREATED:20240118T184108Z
LAST-MODIFIED:20240118T184230Z
UID:7478-1706110200-1706113800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Torsten Mütze\, Un. Warwick\nTitle: Kneser graphs are Hamiltonian\n  \nAbstract: For integers k>=1 and n>=2k+1\, the Kneser graph K(n\,k) has as vertices all k-element subsets of an n-element ground set\, and an edge between any two disjoint sets. It has been conjectured since the 1970s that all Kneser graphs admit a Hamilton cycle\, with one notable exception\, namely the Petersen graph K(5\,2). This problem received considerable attention in the literature\, including a recent solution for the sparsest case n=2k+1. The main contribution of our work is to prove the conjecture in full generality. We also extend this Hamiltonicity result to all connected generalized Johnson graphs (except the Petersen graph). The generalized Johnson graph J(n\,k\,s) has as vertices all k-element subsets of an n-element ground set\, and an edge between any two sets whose intersection has size exactly s. Clearly\, we have K(n\,k)=J(n\,k\,0)\, i.e.\, generalized Johnson graphs include Kneser graphs as a special case. Our results imply that all known families of vertex-transitive graphs defined by intersecting set systems have a Hamilton cycle\, which settles an interesting special case of Lovász’ conjecture on Hamilton cycles in vertex-transitive graphs from 1970. Our main technical innovation is to study cycles in Kneser graphs by a kinetic system of multiple gliders that move at different speeds and that interact over time\, reminiscent of the gliders in Conway’s Game of Life\, and to analyze this system combinatorially and via linear algebra.\n  \nThis is joint work with my students Arturo Merino (TU Berlin) and Namrata (Warwick).\n\n———————————————————\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-8/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20240117T153000
DTEND;TZID=UTC:20240117T163000
DTSTAMP:20260611T220657
CREATED:20240110T181847Z
LAST-MODIFIED:20240110T182517Z
UID:7474-1705505400-1705509000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker:  Leslie Hogben\, Iowa State University\nTitle:         Forts\, (fractional) zero forcing\, and Cartesian products of graphs\n\nAbstract: Zero forcing is an iterative process that repeatedly applies a rule to change the color of vertices of a graph $G$ from white to blue. The  zero forcing number is the minimum number of initially blue vertices that are needed to color all vertices blue through this process.  Standard zero forcing was introduced about fifteen years ago  in the control of quantum systems and as an upper bound for  maximum multiplicity of an eigenvalue (or maximum nullity) among matrices having off-diagonal nonzero pattern described by the edges of the graph $G$\, and rediscovered later both as part of power domination and as fast-mixed graph searching.\n\nWhether a set is a zero forcing set can be tested using a certain type of set called a fort\, which obstructs zero forcing.   The maximum number of disjoint forts (fort number)  provides another  lower bound for the zero forcing number; results about fort number will be discussed.  Forts can be used in integer programs to determine the zero forcing number and fort number.  The relaxation of these integer programs leads to dual linear programs that define the fractional zero forcing number\, or equivalently\, the fractional fort number\, and results about these parameters will be discussed.\n\nThere is a well-known upper bound for the zero forcing number of a Cartesian product in terms of the zero forcing numbers and orders of the constituent graphs.  The question of a lower bound for the zero forcing number of a Cartesian product has recently been studied.  It is easy to see that there is a Vizing-like lower bound when the constituent graphs of the Cartesian product both have maximum nullity equal to zero forcing number.  Fractional zero forcing and fort number provide additional lower bounds on the the zero forcing number of a Cartesian product in terms of parameters of the constituent graphs.\n\n______________________________________________________________________________\nJeannette Janssen is inviting you to a scheduled Zoom meeting.\n\nTopic: Atlantic Graph Theory Seminar\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-leslie-hogben/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20231201T140000
DTEND;TZID=UTC:20231201T150000
DTSTAMP:20260611T220657
CREATED:20231127T130930Z
LAST-MODIFIED:20231127T131014Z
UID:7467-1701439200-1701442800@aarms.math.ca
SUMMARY:Advances in Statistical  Modeling of Fisheries Data - Seminar
DESCRIPTION:A Spatiotemporal Model of Condition to Derive a Novel Starvation Mortality Index That Improves a State-space Stock Assessment Model for Atlantic Cod on the Southern Grand Bank of Newfoundland \nMadhura Weerasekera\, Centre for Fisheries Ecosystems Research (CFER)\, Fisheries and Marine Institute of Memorial University of Newfoundland \nThe Atlantic cod stock on the Southern Grand Bank (SGB) of Newfoundland collapsed in the early 1990’s coincident with the collapse of cod stocks across Canadian waters. Consequently\, a fishing moratorium has been in place for this stock since 1994. SGB cod is characterized by low productivity and poor fish condition relative to some other cod stocks. The primary focus of my research is to investigate how fish condition influences the natural mortality rate (M) and the prospects for rebuilding for the SGB cod stock. I developed a novel spatiotemporal condition model using DFO spring and fall survey measurements of fish length and weight. A stochastic approach was used to model weight as a function of length (i.e.\, condition) and other effects for survey strata\, year\, month\, length\, and their interactions. Model selection criteria were used to determine the best model. The model formulation that included only the interaction effects was the best fitting. This model was used to derive a novel length-based starvation mortality rate (MK) index. Results indicated that the MK index is higher in the spring than in the fall. It is also higher for cod between 55-80 cm in length and for cod larger than 120 cm. Additionally\, the MK index was found to be higher during 1991-1993 when the stock experienced a substantial decline\, and it was also high in 2016. The MK index was then converted into an age-based index and incorporated into an age-based state-space stock assessment model (SSAM) as a component of M. The inclusion of MK in the SSAM led to a significant decrease (62%) in the size of the cohort process errors (i.e.\, their standard deviation). This reduction suggests that the MK significantly improved the model of stock productivity. Therefore\, I conclude that MK explains a substantial portion of the variation in M\, and that starvation mortality is an important component of the productivity of SGB cod. \nMeeting Link: \n\n\n\nJoin from the meeting link\n\n\nhttps://mun.webex.com/mun/j.php?MTID=mc6c30b8769a0732739e102e6f596a125\n\n\n\n  \n\n\n\nJoin by meeting number\n\n\nMeeting number (access code): 2772 604 8669\n\n\nMeeting password: mbGAJdJ8k73\n\n\n\n 
URL:https://aarms.math.ca/event/advances-in-statistical-modeling-of-fisheries-data-seminar/
LOCATION:online via webex
ORGANIZER;CN="Asokan Mulayath Variyath":MAILTO:variyath@mun.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20231201
DTEND;VALUE=DATE:20231205
DTSTAMP:20260611T220657
CREATED:20230922T154458Z
LAST-MODIFIED:20230922T154458Z
UID:7322-1701388800-1701734399@aarms.math.ca
SUMMARY:Session on Combinatorial Design Theory at the 2023 Winter Meeting of the Canadian Mathematical Society
DESCRIPTION:Combinatorial design theory has a history dating back to the 18th century when Leonhard Euler pondered the existence of orthogonal pairs of Latin squares. This session will showcase recent results in topics such as classical designs\, cycle systems\, graph decompositions\, Latin squares and other aspects of design theory.
URL:https://aarms.math.ca/event/session-on-combinatorial-design-theory-at-the-2023-winter-meeting-of-the-canadian-mathematical-society/
LOCATION:Montreal\, Montreal\, Quebec\, Canada
CATEGORIES:AARMS sponsored events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20231129T153000
DTEND;TZID=UTC:20231129T163000
DTSTAMP:20260611T220657
CREATED:20231124T122206Z
LAST-MODIFIED:20231124T122206Z
UID:7462-1701271800-1701275400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Jordan Barrett\, Toronto Metropolitan University\nTitle: Graph burning\, the burning number conjecture\, and burning density \nAbstract: Graph burning is a discrete time process on a graph that acts as a simple model for the spread of social contagion in a network. Graph burning was introduced by Bonato\, Janssen and Roshanbin in 2014\, and with this introduction came the now famous “burning number conjecture”. In the first half of my talk\, I will introduce graph burning and give a brief overview of the progress made towards the burning number conjecture. Then\, for the remainder of the talk\, I will introduce a variation of graph burning in which the graph grows over time. In this variation\, if the graph grows fast enough then we may never be able to burn all of the vertices at any given time. We are instead interested in the “burning density”\, i.e.\, the limiting ratio of burning vertices to all vertices. The talk will conclude with some new results by Gunderson\, Nir\, Pralat\, and myself\, classifying the obtainable burning densities on growing grid-graphs. \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-7/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20231124
DTEND;VALUE=DATE:20231125
DTSTAMP:20260611T220657
CREATED:20230922T153457Z
LAST-MODIFIED:20230922T153847Z
UID:7316-1700784000-1700870399@aarms.math.ca
SUMMARY:University of New Brunswick Data Challenge 2023
DESCRIPTION:The UNB Data Challenge 2023 will bring together two competitive tracks\, Data Visualization (8th Annual)\, and Data Analytics (4th Annual) on Nov. 24\, 2023\, in a virtual format! Take up the challenge and demonstrate the power of data.\nParticipants and teams will have the chance to showcase their ability to tell a story driven by data in unique competitive formats. Teams can participate in both tracks. It is an ideal setting for citizens to get engaged\, meet leaders in academia\, government\, and private organizations\, and explore the world of data science.
URL:https://aarms.math.ca/event/university-of-new-brunswick-data-challenge-2023/
LOCATION:University of New Brunswick (Fredericton Campus)\, Fredericton\, New Brunswick\, Canada
CATEGORIES:AARMS outreach events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20231122T153000
DTEND;TZID=UTC:20231122T163000
DTSTAMP:20260611T220657
CREATED:20231118T113007Z
LAST-MODIFIED:20231118T113007Z
UID:7454-1700667000-1700670600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker:  Santiago Guzman-Pro\, TU Dresden\nTitle:          Forbidden Tournaments and the Orientation (Completion) Problem\n\nAbstract:   For a fixed finite set of  oriented graphs F\,  the F-free  orientation problem asks\nwhether a given finite undirected graph G has an F-free orientation\, i.e.\, whether the edges\nof  G  can be  oriented so that the  resulting  oriented  graph does not contain  any oriented\ngraph from F as an oriented (induced) subgraph. It was first noted by Bang-Jensen\, Huang\,\nand Prisner that when F is a set of oriented paths on 3 vertices\, this problem easily reduces\nto 2-SAT\, and thus is solvable in polynomial-time. This was later extended to sets of oriented\ngraphs on 3 vertices (G.P.\ and Hernández-Cruz 2017). Towards a complete understanding\nof the complexity of the F-free orientation problem\,  we consider the case when  F is a set of\nfinite  tournaments.     We prove that  for every  such  F\,  this problem is in P or NP-complete.Specifically\, we show that either the F-free orientation problem can be reduced (in polynomial-\ntime) to a system of Boolean linear equations\, or the F-free orientation problem is NP-complete.\nThis  dichotomy result is  accompanied  by a  classification  statement  which\, given a set of\ntournaments  F\,   allows  us  to decide  whether  the  F-free  orientation  problem  is in  P  or\nNP-complete. We reduce this classification task to a complete complexity classification of the\norientation completion problem for F\, which is the variant of the problem above where the input\nis a partially oriented graph instead of an undirected graph\, introduced by Bang-Jensen\, Huang\,\nand Zhu (2017). Our proof uses results from the theory of constraint satisfaction\, and a result\nof Agarwal and Kompatscher (2018) about infinite permutation groups and transformation monoids.\n\nThis is joint work with Manuel Bodirsky.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-6/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20231101T153000
DTEND;TZID=UTC:20231101T163000
DTSTAMP:20260611T220657
CREATED:20231028T105516Z
LAST-MODIFIED:20231028T105516Z
UID:7402-1698852600-1698856200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Detecting (Di)Graphical Regular Representations \nSpeaker: Joy Morris\, U. Lethbridge \nAbstract: Graphical and Digraphical Regular Representations (GRRs and DRRs) are a concrete way to visualise the regular action of a group\, using (di)graphs. More precisely\, a GRR or DRR on the group $G$ is a (di)graph whose automorphism group is isomorphic to the regular action of $G$ on itself by right-multiplication.\n\nFor a (di)graph to be a DRR or GRR on $G$\, it must be a Cayley (di)graph on $G$. Whenever the group $G$ admits an automorphism that fixes the connection set of the Cayley (di)graph setwise\, this induces a nontrivial graph automorphism that fixes the identity vertex\, which means that the (di)graph is not a DRR or GRR. Checking whether or not there is any group automorphism that fixes a particular connection set can be done very quickly and easily compared with checking whether or not any nontrivial graph automorphism fixes some vertex\, so it would be nice to know if there are circumstances under which the simpler test is enough to guarantee whether or not the Cayley graph is a GRR or DRR. I will present a number of results on this question.\n\n\nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n 
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-5/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20231018T153000
DTEND;TZID=UTC:20231018T163000
DTSTAMP:20260611T220657
CREATED:20231012T115001Z
LAST-MODIFIED:20231012T223528Z
UID:7376-1697643000-1697646600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Two short talks by grad students Alex Clow and William Kellough. ‘Live’ viewing in Chase 227 for those at Dalhousie. \nTalk 1:\nAlex Clow\, Simon Fraser University\nPolynomially Bounding the Oriented Chromatic Number in Euler Genus \nIn this talk we consider the oriented chromatic number of graphs with bounded Euler genus. In particular\, we present our proofs that the oriented chromatic number is at most $g^{6400}$ for sufficiently large $g$ and at least $\Omega((\frac{g^2}{\log g})^{1/3})$. This is a major improvement over the previous best upper bound which is exponential in genus. We conclude the talk by discussing directions for future study. Joint work with Peter Bradshaw and Jingwei Xu from the University of Illinois at Urbana Champaign. \nTalk 2:\nWilliam Kellough\, Memorial University\nHow to Catch a Cheating Robber on Strong Products \nCops and Robbers is a pursuit-evasion game played on the vertices of a graph. One player controls a set of cops and the other player controls a robber. The cops win if a cop can move to the vertex occupied by the robber in finitely many turns\, otherwise the robber wins. In this talk\, we consider a variation of Cops and Robbers where both players move simultaneously and the robber “cheats” by knowing how the cops will move each round. We will give bounds on the minimum number of cops needed to win this game when played on the strong product of two graphs. This is joint work with Nancy Clarke and Danny Dyer. \nJoin Zoom Meeting\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-4/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20231016
DTEND;VALUE=DATE:20231021
DTSTAMP:20260611T220657
CREATED:20230204T181746Z
LAST-MODIFIED:20230204T181746Z
UID:7080-1697414400-1697846399@aarms.math.ca
SUMMARY:Women in Commutative Algebra II
DESCRIPTION:The purpose of this event is to establish and enhance research networks among women and female identifying mathematicians who work in the areas of mathematics related to commutative algebra. It will be the second of its kind. The first one (Banff 2019) was an amazing success\, with many of the groups still working together. It has led to a strong network that besides research\, provides visibility for women and many opportunities for professional development. It has also served as an example for younger women. We are hoping that WICA II\, with its European location\, will be more accessible to a larger geographic area. \nWe need general funds\, as most of the sources we apply to are targetted to special regions. Any support from AARMS will be appreciated. If we do not raise enough funds\, the event will go ahead but we will have to reduce the number of participants.
URL:https://aarms.math.ca/event/women-in-commutative-algebra-ii/
LOCATION:Trento\, Trento\, Italy
CATEGORIES:AARMS sponsored events
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20231013
DTEND;VALUE=DATE:20231016
DTSTAMP:20260611T220657
CREATED:20230525T105834Z
LAST-MODIFIED:20230525T105834Z
UID:7220-1697155200-1697414399@aarms.math.ca
SUMMARY:2023 Science Atlantic MSCS Conference
DESCRIPTION:The Science Atlantic Mathematics\, Statistics\, and Computer Science Conference is an annual regional event. It provides a platform for undergraduate students in Mathematics\, Statistics and Computer Science at Atlantic Canadian universities to disseminate their research projects\, participate in contests\, and network with other students in the region. It also serves as a networking event for faculty members of Atlantic Canadian universities. In 2023\, University of Prince Edward Island will host the conference in Charlottetown\, PEI. The dates of the conference is October 13- 15\, 2023. Some of the major programs are as follows: Field Lecture\, Blundon Lecture\, Sedgewick Lecture\, Contributed Student’s talks\, Mathematics Competition\, CS Programming Competition\, AARMS Session\, Science Atlantic joint Math/CS meeting\, Science Atlantic Math and Stats. meeting\, Science Atlantic CS meeting\, Graduate Student’s Session etc.
URL:https://aarms.math.ca/event/2023-science-atlantic-mscs-conference/
LOCATION:University of Prince Edward Island\, Charlottetown\, Prince Edward Island\, Canada
CATEGORIES:AARMS sponsored events
ORGANIZER;CN="Shafiqul Islam":MAILTO:sislam@upei.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20231004T153000
DTEND;TZID=UTC:20231004T163000
DTSTAMP:20260611T220657
CREATED:20230930T100717Z
LAST-MODIFIED:20230930T100717Z
UID:7351-1696433400-1696437000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker: Iain Beaton\, Acadia University\nTitle: On the Unimodality of Nearly-Well Dominated Trees\n\n\nAbstract: A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph G is the generating function of the number of dominating sets of each cardinality in G\, and its coefficients have been conjectured to be unimodal. In this talk we will show the domination polynomial of a tree T is unimodal so long as the sizes of the minimal dominating sets of T do not differ by too much. We will also discuss a version of this result for directed trees and its connection to the unimodality conjecture for the independence polynomial of a well-covered tree.\n\n \nZoom link:\n\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-3/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20230920T153000
DTEND;TZID=UTC:20230920T163000
DTSTAMP:20260611T220657
CREATED:20230915T200900Z
LAST-MODIFIED:20230915T200900Z
UID:7306-1695223800-1695227400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Time: 3.30pm\, Atlantic time\, Wednesday Sept.20\nSpeaker: Jessica McDonald\, Auburn University\n\nTitle: On flows (and group-connectivity) in signed graphs \nAbstract:\n\n\n\n\n\n\nIn this talk we’ll start by discussing flows in signed graphs and how it generalizes the usual notion of integer flows in graphs. In particular\, flow-colouring duality of graphs in the plane can be re-interpreted using signed graphs in the projective plane. Also\, where a flow in a graph can be viewed as a sum of flows on cycles\, in a signed graph\, positive cycles and barbells are the key structures to consider. We’ll share a new result\, joint with K. Nurse and A. Brewer-Castano\, about flows in 3-edge-connected signed graphs. In fact\, this result holds for the stronger notion of group-connectivity\, which was introduced as a generalization of flows by Jaeger\, Linial\, Payan\, and Tarsi in 1992. Building on their work and also on work by Li\, Luo\, Ma and Zhang (2018)\, we (mostly) establish a group-connected analog of Seymour’s 6-flow Theorem for signed graphs. \n\n\n\n\n\n\nZoom link:\nhttps://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09\n\nMeeting ID: 864 1523 0827\nPasscode: 835547
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-2/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20230821
DTEND;VALUE=DATE:20230828
DTSTAMP:20260611T220657
CREATED:20230131T104337Z
LAST-MODIFIED:20230131T104337Z
UID:7056-1692576000-1693180799@aarms.math.ca
SUMMARY:Groups\, Rings\, Lie and Hopf Algebras. Fifth Edition
DESCRIPTION:Our next International workshop “Groups\, Rings\, Lie and Hopf Algebras. V” will be held at the Harlow campus of Memorial University in the United Kingdom on August 21 – 27\, 2022. This is the first time the venue of our workshop will be outside North America. The web site of their campus is  here. \nThe organizing committee consists of Yuri Bahturin (Memorial University)\, Mikhail Kotchetov (Memorial University)\, Kirill Zaynullin (University of Ottawa)\, and Alexander Premet (University of Manchester). \nA preliminary list of speakers includes: \n\nAljadeff\, Eli (Technion)\nAra\, Pere (Universitat Autònoma de Barcelona)\nBaird\, Tom (Memorial University)\nBaranov\, Alexander (University of Leicester)\nBillig\, Yuly (Carleton University)\nBrzeziński\, Tomasz (Swansea University)\nElduque\, Alberto (Universidad de Zaragoza)\nJespers\, Eric (Vrije Universiteit Brussel)\nMartinez-Pedroza\, Eduardo  (Memorial University)\nMinasyan\, Ashot (University of Southampton)\nNeher\, Erhard (University of Ottawa)\nSchweigert\, Christoph (University of Hamburg)\nSierra\, Susan (University of Edinburgh)\nShpektorov\, Sergei (University of Birmingham)\nSmoktunowicz\, Agata (University of Edinburgh)\nSommerhäuser\, Yorck (Memorial University)\nTraustason\, Gunnar (University of Bath)\nVaughan-Lee\, Michael (University of Oxford)\nZalesski\, Alexandre (University of East Anglia)\n\nThe workshop is organized in the framework of the collaborative research group “Groups\, Rings\, Lie and Hopf Algebras” of the Atlantic Association for Research in the Mathematical Sciences (AARMS). An updated list of speakers and other information will be posted on this page. \nIf you are interested in attending the workshop\, please send an email to this address (aac@mun.ca) with GRLHA23 in the subject line by May 15\, 2023. If you would like to give a talk\, please include the title and abstract. \nThere are limited funds available to cover accommodation on the Harlow campus. If you would like to request this support\, please write to aac@mun.ca; if you are not a member of the collaborative research group\, please attach your CV.
URL:https://aarms.math.ca/event/groups-rings-lie-and-hopf-algebras-fifth-edition/
LOCATION:Memorial University (Harlow Campus)\, 44 Market Street\, Harlow\, United Kingdom
CATEGORIES:AARMS workshops and conferences
ORGANIZER;CN="Mikhail Kotchetov":MAILTO:Mikhail@mun.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20230731
DTEND;VALUE=DATE:20230802
DTSTAMP:20260611T220657
CREATED:20230801T124723Z
LAST-MODIFIED:20230801T124723Z
UID:7273-1690761600-1690934399@aarms.math.ca
SUMMARY:2nd workshop of AARMS CRG on Mathematical Foundations of Scientific Machine Learning
DESCRIPTION:This is the 2nd workshop of the AARMS Collaborative Research Group on Mathematical Foundations in Scientific Machine Learning\, which will be held on the Fredericton Campus of the University of New Brunswick on Jul 31 – Aug 01\, 2023. \nThe theme of the workshop is as broad as the scientific research programs of the partners in the AARMS CRG group\, including Machine Learning approaches in Mathematics\, Geophysics\, Chemistry\, Statistics\, etc.
URL:https://aarms.math.ca/event/2nd-workshop-of-aarms-crg-on-mathematical-foundations-of-scientific-machine-learning/
LOCATION:University of New Brunswick (Fredericton Campus)\, Fredericton\, New Brunswick\, Canada
CATEGORIES:AARMS workshops and conferences
ORGANIZER;CN="Nicholas Touikan":MAILTO:nicholas.touikan@unb.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20230731
DTEND;VALUE=DATE:20230805
DTSTAMP:20260611T220657
CREATED:20230204T180819Z
LAST-MODIFIED:20230204T180819Z
UID:7069-1690761600-1691193599@aarms.math.ca
SUMMARY:6th International Conference on Applied Category Theory
DESCRIPTION:Established in 2018\, the annual International Conference on Applied Category Theory brings together researchers\, programmers\, scientists and industry who seek to apply the foundational field of category theory to fields outside of mathematics. The ACT Adjoint School is annual research school adjoining the conference. The research school is aimed at fostering an open-hearted and open-minded environment where new applied category theorists develop the skills of research\, welcoming new researchers into cutting-edge research programs in applied category theory\, and to grow and strengthen the applied category theory community. The research school convenes online once every two weeks for 4 months before the conference and concludes research projects during the in-person research week before the conference.
URL:https://aarms.math.ca/event/6th-international-conference-on-applied-category-theory/
LOCATION:University of Maryland\, college Park\, MD\, United States
CATEGORIES:AARMS sponsored events
ORGANIZER;CN="Priyaa Varshinee Srinivasan":MAILTO:priyaavarshinee.srin@ucalgary.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20230730T130000
DTEND;TZID=UTC:20230730T173000
DTSTAMP:20260611T220657
CREATED:20230712T231641Z
LAST-MODIFIED:20230717T144343Z
UID:7247-1690722000-1690738200@aarms.math.ca
SUMMARY:Bridges Math and Art Family Day
DESCRIPTION:AARMS would like to invite everyone to the Bridges 2023 Math and Art family day!  This exciting event is part of the Bridges 2023 conference on Math and Art\, and will be held at the Halifax Central Library on Sunday\, July 30 from 1:00 pm to 5:30 pm.  Family day incorporates hands-on workshops\, mathematical poetry reading\, a short film festival\, and a mathematical art exhibition in the nearby Medjuck Building on Dalhousie’s Sexton Campus.
URL:https://aarms.math.ca/event/bridges-math-and-art-family-day/
LOCATION:Halifax Central Library
CATEGORIES:AARMS outreach events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20230727T200000
DTEND;TZID=UTC:20230727T213000
DTSTAMP:20260611T220657
CREATED:20230712T232857Z
LAST-MODIFIED:20230712T235100Z
UID:7251-1690488000-1690493400@aarms.math.ca
SUMMARY:Public Lecture: The hat\, the turtle and the spectre
DESCRIPTION:Come hear about the recent solution to a longstanding unsolved problem in geometry: it is possible for a single shape to tile the plane without any sort of repeating pattern? The “hat”\, it turns out\, solves this problem. It’s the first known aperiodic monotile\, also known as an “Einstein”. In this public lecture\, Craig Kaplan from the University of Waterloo (a member of the collaboration that discovered the “hat”)\, will talk about some background concepts from tiling theory and the history of the search for aperiodic shapes. The story of this discovery of the hat and the proof of its aperiodicity\, as well as two other closely related shapes\, the “turtle” and the “spectre”\, will dazzle you with their application to derive more results about aperiodic tilings. \nThis talk will be in the Irving Oil Auditorium in the Richard Murray Design Building on Thursday\, July 27 from 8:00 pm – 9:30 pm. \nRead more about the recent discovery of the aperiodic monotile: \n\nElusive ‘Einstein’ Solves a Longstanding Math Problem (New York Times)\nNewfound Mathematical ‘Einstein’ Shape Creates a Never-Repeating Pattern (Scientific American)\n‘The miracle that disrupts order’: mathematicians invent new ‘einstein’ shape (The Guardian)\nMathematicians say they have invented an ‘impossible’ tile that never repeats (CTV news)
URL:https://aarms.math.ca/event/public-lecture-the-hat-the-turtle-and-the-spectre/
LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20230727
DTEND;VALUE=DATE:20230801
DTSTAMP:20260611T220657
CREATED:20230712T231020Z
LAST-MODIFIED:20230712T231020Z
UID:7244-1690416000-1690847999@aarms.math.ca
SUMMARY:Bridges Halifax 2023
DESCRIPTION:This conference is the premier international\, interdisciplinary conference connecting mathematics and art. The goal of the Bridges meetings is to foster research\, practice\, and new interest in mathematical connections to art\, music\, architecture\, education and culture. All too often\, mathematics can seem disconnected from or even antithetical to these other topics. We believe that mathematics and art can inform and enrich each other\, that there are great ideas waiting to be found in the mathematical analysis of art\, and that artistic thinking and activities can enliven what we understand about mathematics. \nThe Bridges conference brings together an interdisciplinary group of mathematicians\, scientists\, engineers\, artists\, educators\, musicians\, writers\, computer scientists\, sculptors\, dancers\, weavers\, model builders and many others in an atmosphere of mutual exchange and inspiration. \n 
URL:https://aarms.math.ca/event/bridges-halifax-2023/
LOCATION:Dalhousie University\, Halifax\, Nova Scotia\, Canada
CATEGORIES:AARMS workshops and conferences
END:VEVENT
END:VCALENDAR