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:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:America/Halifax
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20200308T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20201101T050000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20210314T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20211107T050000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20220313T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20221106T050000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20211201T153000
DTEND;TZID=UTC:20211201T163000
DTSTAMP:20260613T183330
CREATED:20211128T200242Z
LAST-MODIFIED:20211128T200242Z
UID:6543-1638372600-1638376200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: James Preen (Cape Breton University)
DESCRIPTION:There are many results about triangles in graphs\, but the property that every edge in a graph is in at least one triangle seems not to have been studied before. The 4-regular case was quickly solved collaboratively following an internet posting and then written about by one author in their blog\, before being published in the Journal of Graph Theory in 2013. \nHowever\, the result that was originally wanted was a characterisation for 5-regular graphs\, and that did not emerge as smoothly. With no solution published several years later\, I started working on it and have submiited my paper resolving it in 2021. In this talk I will outline the background and the ideas used in the proof\, which involves cliques\, multiple edges and a generalisation of the the line graph construction. \nJoin Zoom Meeting: link\nTo view previous slides and talks\, click here.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-james-preen-cape-breton-university/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20211203T160000
DTEND;TZID=America/Halifax:20211203T170000
DTSTAMP:20260613T183330
CREATED:20200904T115630Z
LAST-MODIFIED:20211124T221439Z
UID:6271-1638547200-1638550800@aarms.math.ca
SUMMARY:Dalhousie-AARMS AAMP Seminar: Jesse Gell-Redman (University of Melbourne)
DESCRIPTION:Title: A Fredholm approach to scattering \nAbstract: We will give a friendly introduction to the scattering theory\, specifically to the matrix for Schrodinger operators.  We will then discuss how a new functional analytic approach to analysis of non-elliptic equations\, due to Vasy\, gives a conceptually attractive method for proving detailed regularity results for nonlinear scattering.  This is joint work with several groups of authors including Andrew Hassell\, Sean Gomes\, Jacob Shapiro\, and Junyong Zhang. \nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time over Zoom.  If you would like to attend\, please email the organizers for connection details.
URL:https://aarms.math.ca/event/dalhousie-aarms-aamp-seminar-steven-lester-kings-college-london-2-2-3-2-2-2/
LOCATION:Zoom seminar
CATEGORIES:AAMP Seminar
ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211207T110000
DTEND;TZID=UTC:20211207T120000
DTSTAMP:20260613T183330
CREATED:20211126T123922Z
LAST-MODIFIED:20211126T123922Z
UID:6540-1638874800-1638878400@aarms.math.ca
SUMMARY:AARMS Scientific Machine Learning Seminar: Peter Dueben (ECMWF)
DESCRIPTION:This talk provides an overview on the machine learning efforts at the European Centre for Medium-Range Weather Forecasts (ECMWF)\, and outlines how machine learning\, and in particular deep learning\, could help to improve weather predictions in the coming years. The talk will name challenges for the use of machine learning and suggest developments (research/software/hardware) that should enable the community of Earth system modelling to make quick progress. \nWebex information: \nLink: https://mun.webex.com/mun/j.php?MTID=m32a22bd61d05707cefe973ca5bf6ad69 \nMeeting no: 2631 545 3588 \nPassword: t32XHrsMqu6
URL:https://aarms.math.ca/event/aarms-scientific-machine-learning-seminar-peter-dueben-ecmwf/
LOCATION:WebEx seminar
CATEGORIES:AARMS Scientific Machine Learning Seminar
ORGANIZER;CN="Alexander Bihlo":MAILTO:abihlo@mun.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211208T153000
DTEND;TZID=UTC:20211208T163000
DTSTAMP:20260613T183330
CREATED:20211206T120336Z
LAST-MODIFIED:20211206T120336Z
UID:6547-1638977400-1638981000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Sandra Kingan (Brooklyn College and Graduate Center\, CUNY)
DESCRIPTION:I will begin by giving a general overview of what it means to find monarchs for excluded minor classes of graphs and matroids. In a paper that appeared in 2018\, I used the Strong Splitter Theorem to give a short proof of Oxley’s result that the class of binary matroids with no 4-wheel minor consists of a few small matroids and an infinite family of maximal 3-connected rank r matroids known as the binary spikes. Such a family is called a monarch for the excluded minor class. This proof essentially comes down to finding the monarchs for non-regular matroids with no minors isomorphic to a 9-element rank 4 matroid known as P9 or its dual P*9. In a paper that appeared this year (Australasian Journal of Combinatorics\, 79(3)\, 302–326)\, I was able to strengthen the result by characterizing the class of binary non-regular matroids with no minor isomorphic to just P*9. The only members of this class are the rank 3 and 4 binary projective geometries\, a 16-element rank 5 matroid\, and two monarchs: the rank r binary spikes with 2r+1 elements mentioned earlier and another infinite family with 4r−5 elements. As a consequence\, a simple binary matroid of rank at least 6 with no P*9-minor has size at most r(r+1)/2 and this bound is attained by the rank r complete graph. This is one of few excluded minor classes for which the members are so precisely determined. \n  \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-sandra-kingan-brooklyn-college-and-graduate-center-cuny/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
END:VEVENT
END:VCALENDAR