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:VEVENT
DTSTART;TZID=UTC:20231101T153000
DTEND;TZID=UTC:20231101T163000
DTSTAMP:20260612T060858
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:20231122T153000
DTEND;TZID=UTC:20231122T163000
DTSTAMP:20260612T060858
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;VALUE=DATE:20231124
DTEND;VALUE=DATE:20231125
DTSTAMP:20260612T060858
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:20231129T153000
DTEND;TZID=UTC:20231129T163000
DTSTAMP:20260612T060858
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
END:VCALENDAR