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:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20241002T153000
DTEND;TZID=UTC:20241002T163000
DTSTAMP:20260611T154302
CREATED:20240928T105843Z
LAST-MODIFIED:20240928T105843Z
UID:7719-1727883000-1727886600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:The Martin Invariant and Other Results on the Interlace Polynomials \nJosephine Reynes\, University of Waterloo \nThere are many well studied graph polynomials\, but this talk will focus on the Martin polynomial and the interlace polynomial. Specifically\, this talk will look at how these two polynomials are related and how results on the Martin polynomial can be extended to the interlace polynomial. The Martin invariant\, a specific evaluation of the Martin polynomial\, obeys the symmetries of the Feynman period. The Feynman period of a graph is useful in quantum field theory\, but difficult to compute and thus there is interest in finding graph invariants that have the same symmetries. It was quickly established that the interlace polynomial on interlace graphs was equal to the Martin polynomial on the associated 4-regular graph. While only graphs not containing a set of forbidden vertex minors are interlace graphs\, the interlace polynomial is defined over all graphs. We discuss how this provides a way to try and extend the notion of Feynman symmetries via the interlace polynomial and some specific classes of graphs with formulas. Additionally\, the interlace polynomial is only equal to the Martin polynomial for interlace graphs of 4-regular graphs\, but the Martin polynomial is defined for 2k-regular graphs. Thus\, we work toward creating an interlace-like polynomial for graphs derived from 2k-regular cases of the Martin polynomial. \nZoom link:\nhttps://us02web.zoom.us/j/86861499971?pwd=rTDAaju0TCu24asnaBGvkuNlT11KZ1.1 \nMeeting ID: 868 6149 9971\nPasscode: 325258
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-17/
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:20241004
DTEND;VALUE=DATE:20241006
DTSTAMP:20260611T154302
CREATED:20240516T163916Z
LAST-MODIFIED:20240516T163916Z
UID:7612-1728000000-1728172799@aarms.math.ca
SUMMARY:2024 Science Atlantic Mathematics Statistics and Computer Science Undergraduate Student Conference
DESCRIPTION:The 2024 Science Atlantic Mathematics\, and Computer Science Conference will take place at Acadia University during October 4-5\, 2024. The conference will consist of a collection of invited plenary lectures\, mathematics and computer science competitions and scientific research presentations by undergraduate students. \nThe conference is part of the larger annual Science Atlantic Mathematics\, Statistics and Computer Science Conference series. \nOne overall aim of this exciting conference series is to bring together undergraduate students and faculty from universities based in Atlantic Canada. In doing so\, the conference series promotes Scientific Discovery and literacy within the Mathematical\, Statistical and Computing Sciences while at the same time fostering existing and promoting new collaborative and interdisciplinary activities amongst students and faculty.
URL:https://aarms.math.ca/event/2024-science-atlantic-mathematics-statistics-and-computer-science-undergraduate-student-conference/
LOCATION:Acadia University\, Wolfville\, Nova Scotia\, Canada
CATEGORIES:AARMS sponsored events
ORGANIZER;CN="Nathan Grieve":MAILTO:nathan.grieve@acadiau.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20241023T153000
DTEND;TZID=UTC:20241023T163000
DTSTAMP:20260611T154302
CREATED:20241018T101206Z
LAST-MODIFIED:20241018T101259Z
UID:7744-1729697400-1729701000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Speaker #1: Peter Collier\, Dalhousie University\nTitle #1: Zero Forcing on Twisted Hypercubes\n\nAbstract #1:\nThe hypercube stands out as a compelling and versatile structure that extends the geometric notion of a cube into higher dimensions. We study the twisted hypercube variant in an attempt to optimize processes on similarly degree-regular\, highly connected graphs. The particular process we optimize is zero forcing\, a graph infection process in which a particular colour change rule is iteratively applied to the graph and an initial set of vertices. We use the alternative framing  of forcing arc sets to construct a family of twisted hypercubes of dimension k$\geq3$ with zero forcing sets of size $2^{k-1}-2^{k-3}+1$.\n\n\nSpeaker #2: Alexander Clow\, Simon Fraser University\nTitle #2: Cornering Robots and Synchronizing Automata\n\n\nAbstract #2:\nA deterministic finite automata (DFA) is a model for any deterministic computational system with a finite number of states. In this talk\, we describe a DFA as a finite directed multigraph G = (V\, E)\, possibly with loops\, along with an edge labelling ψ : E → Ψ. Here the vertices of the graph are the states the system might be in\, the edge labels are possible inputs to the system\, and the edges represent the transitions between states. Words σ generated from the alphabet Ψ act on vertices\, v\, as if v is the initial state of the system\, and σ(v) is the state of the system after input σ is given. A word σ is synchronizing if for all u\, v ∈ V \, σ(u) = σ(v).\nIn this talk\, we define a general strategy for constructing synchronizing words\, which we call the cornering strategy. We then show that a DFA is synchronizable if and only if the cornering strategy can be successfully applied. As a demonstration of the strategy\, we will discuss how all DFAs arising from movement in Rd can be synchronized. This is joint work with Peter Bradshaw (University of Illinois Urbana-Champaign) and Ladislav Stacho (Simon Fraser University).\n\n\nZoom link:\nhttps://us02web.zoom.us/j/86861499971?pwd=rTDAaju0TCu24asnaBGvkuNlT11KZ1.1\n\nMeeting ID: 868 6149 9971\nPasscode: 325258
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-18/
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:20241030T153000
DTEND;TZID=UTC:20241030T163000
DTSTAMP:20260611T154302
CREATED:20241024T112106Z
LAST-MODIFIED:20241024T112106Z
UID:7762-1730302200-1730305800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar
DESCRIPTION:Some problems on graph sequences\nDavid Galvin\, University of Notre Dame\n\nI’ll talk about some problems concerning unimodality (or otherwise) of some graph sequences that come from enumeration. The focus will be on the matching sequence\, the independent set sequence and the domination sequence of a graph. As well as mentioning some recent work (with Ball\, Hyry\, Taylor and Weingartner\, and with Zhang)\, I’ll describe some favorite open problems.\n\nZoom link:\nhttps://us02web.zoom.us/j/86861499971?pwd=rTDAaju0TCu24asnaBGvkuNlT11KZ1.1\n\nMeeting ID: 868 6149 9971\nPasscode: 325258
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-19/
LOCATION:Online via Zoom
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR