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:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:America/Halifax
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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0400
TZOFFSETTO:-0300
TZNAME:ADT
DTSTART:20230312T060000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0300
TZOFFSETTO:-0400
TZNAME:AST
DTSTART:20231105T050000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20220202T153000
DTEND;TZID=UTC:20220202T163000
DTSTAMP:20260613T153820
CREATED:20220130T142415Z
LAST-MODIFIED:20220131T120204Z
UID:6579-1643815800-1643819400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Melissa Huggan (Mount Allison)
DESCRIPTION:The Orthogonal Colouring Game\nThe Orthogonal Colouring Game is a combinatorial game in which two players alternately colour vertices of a pair of isomorphic graphs while respecting the properness and the orthogonality of the colouring. Each player aims to maximize her score\, which is the number of coloured vertices in the copy of the graph she owns. An involution $\sigma$ of a graph $G$ is strictly matched if its fixed point set induces a clique and any non-fixed point $v \in V(G)$ is connected with its image $\sigma(v)$ by an edge. \nIn this talk\, we introduce the game and our main result that the second player has a strategy to force a draw in this game for graphs that admit a strictly matched involution. We will also give a structural characterization of graphs admitting a strictly matched involution. \nThis is joint work with Stephan Dominique Andres\, Francois Dross\, Fionn Mc Inerney\, and Richard J. Nowakowski. \nJoin Zoom Meeting: link \n 
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-melissa-huggan-mount-allison/
LOCATION:Zoom seminar
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20220209T153000
DTEND;TZID=UTC:20220209T163000
DTSTAMP:20260613T153820
CREATED:20220207T121303Z
LAST-MODIFIED:20220207T121303Z
UID:6584-1644420600-1644424200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Margaret-Ellen Messinger (Mount Allison University)
DESCRIPTION:Reconfiguration for Dominating Sets\n\nGiven a problem and a set of feasible solutions to that problem\, the associated  reconfiguration problem involves determining whether one feasible solution to the original problem can be transformed to a different feasible solution through a sequence of allowable moves\, with the condition that the intermediate stages are also feasible solutions.  Any reconfiguration problem can be modelled with a  reconfiguration graph\, where the vertices represent feasible solutions and two vertices are adjacent if and only if the corresponding feasible solutions can be transformed to each other via em one allowable move.The domination reconfiguration graph of a graph $G$\, denoted ${\mathcal D}(G)$\, has a vertex corresponding to each dominating set of $G$ and two vertices of ${\mathcal D}(G)$ are adjacent if and only if the corresponding dominating sets differ by the deletion or addition of a single vertex.  We are interested in properties of domination reconfiguration graphs. For example\, it is easy to see that they are always connected and bipartite.  We can also characterize exactly which graphs yield domination reconfiguration graphs with Eulerian circuits.  While none has a Hamilton cycle\, we explore families of graphs whose reconfiguration graphs have Hamilton paths.\n\n\nJoin Zoom Meeting: link\n\n 
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-margaret-ellen-messinger-mount-allison-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:20220211T160000
DTEND;TZID=America/Halifax:20220211T170000
DTSTAMP:20260613T153820
CREATED:20200904T115630Z
LAST-MODIFIED:20220122T143038Z
UID:6556-1644595200-1644598800@aarms.math.ca
SUMMARY:Dalhousie-AARMS AAMP Seminar: Cyril Letrouit (École Normale Supérieure)
DESCRIPTION:Title – Propagation of singularities in subelliptic PDEs \nAbstract – In this talk\, we consider the wave equation where the Laplacian is replaced by a sub-Laplacian (also called “Hörmander sum of square”)\, which is an hypoelliptic operator. We handle the problem of describing the propagation of singularities in such equations : the main new phenomenon that we describe is that singularities can propagate along abnormal curves at any speed between 0 and 1. This general result extends an idea due to R. Melrose\, and we then illustrate it on anexample\, the Martinet case\, following a joint work with Y. Colin de Verdière.  Our statements are part of a classical/quantum correspondance between sub-Riemannian geometry (on the classical side) and the hypoelliptic operator (on the quantum side)\, which is also helpful to interpret results in control theory and spectral theory of hypoelliptic operators. \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-4/
LOCATION:Zoom seminar
CATEGORIES:AAMP Seminar
ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20220216T153000
DTEND;TZID=UTC:20220216T163000
DTSTAMP:20260613T153820
CREATED:20220215T113731Z
LAST-MODIFIED:20220215T113757Z
UID:6608-1645025400-1645029000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Ferenc Bencs (University of Amsterdam)
DESCRIPTION:In this talk\, I will show regions that contain no complex zeros the edge-cover polynomials of hypergraphs. The edge cover polynomial of a graph $G$ is the generating function of edges that covers $V(G)$. It is known that the zeros of this polynomial have length at most $\frac{(2+\sqrt{3})^2}{1+\sqrt{3}}$\, that we strengthen by showing that it is at most $4$.  We use the general subgraph counting polynomial of Wagner to establish this result along with its generalization for the edge cover polynomial of hypergraphs. As another example\, we will establish a new bound on the length of the zeros of the domination and total domination polynomials of graphs in terms of the maximum degree.\n\n\n\n\n\nJoint work with P\’eter Csikv\’ari and  Guus Regts.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-ferenc-bencs-university-of-amsterdam/
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:20220218T160000
DTEND;TZID=America/Halifax:20220218T170000
DTSTAMP:20260613T153820
CREATED:20200904T115630Z
LAST-MODIFIED:20220211T135448Z
UID:6558-1645200000-1645203600@aarms.math.ca
SUMMARY:Dalhousie-AARMS AAMP Seminar: Micah Milinovich (U. Mississippi)
DESCRIPTION:Title: Fourier optimization\, prime gaps\, and zeta zeros\n\nAbstract: There are many situations where one imposes certain conditions on a function and its Fourier transform and then wants to optimize a certain quantity. I will describe two ways these types of Fourier optimization problems can arise in the context of the explicit formula\, which relates the primes to the zeros of the Riemann zeta-function. Using information from the zeros to study the primes\, I will show how one can prove the strongest known estimates in the classical problem of bounding the maximum gap between consecutive primes assuming the Riemann hypothesis. Using the explicit formula in the other direction\, one can also use Fourier optimization to prove the strongest known conditional estimates for the number of zeta zeros in an interval on the critical line. This is based on joint works with E. Carneiro\, V. Chandee\, and K. Soundararajan.\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-4-2/
LOCATION:Zoom seminar
CATEGORIES:AAMP Seminar
ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20220222T110000
DTEND;TZID=UTC:20220222T120000
DTSTAMP:20260613T153820
CREATED:20220214T125321Z
LAST-MODIFIED:20220214T125321Z
UID:6605-1645527600-1645531200@aarms.math.ca
SUMMARY:AARMS Scientific Machine Learning Seminar:  Alison Malcom (Memorial University)
DESCRIPTION:Using Normalizing Flows for Seismic Data Interpolation\nNormalizing Flows are a type of neural network that allow us to map one probability distribution into another.  The advantage of such a technique is that they allow us to relate a simple distribution\, like a Gaussian\, to a more complicated distribution that may be more difficult to estimate and sample from.  In uncertainty quantification for inverse problems\, we are trying to estimate one of these more complicated distributions\, thus normalizing flows can help to speed up this process and improve our ability to use and analyze our results.  This will be an applied talk\, giving an introduction to normalizing flows\, discussing how we chose the particular machine learning method and explaining how it improves our understanding of seismic data processing and the associated uncertainties.
URL:https://aarms.math.ca/event/aarms-scientific-machine-learning-seminar-alison-malcom-memorial-university/
LOCATION:WebEx seminar
CATEGORIES:AARMS Scientific Machine Learning Seminar
ORGANIZER;CN="Alexander Bihlo":MAILTO:abihlo@mun.ca
END:VEVENT
END:VCALENDAR