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:20211006T153000
DTEND;TZID=UTC:20211006T163000
DTSTAMP:20260613T212200
CREATED:20211004T174543Z
LAST-MODIFIED:20211004T174543Z
UID:6322-1633534200-1633537800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Anthony Bonato (Ryerson University)
DESCRIPTION:In pursuit-evasion games\, a set of pursuers attempts to locate\, eliminate\, or contain an evader in a network. The rules\, specified from the outset\, greatly determine the difficulty of the questions posed above. For example\, the evader may be visible\, but the pursuers may have limited movement speed\, only moving to nearby vertices adjacent to them. \nCentral to pursuit-evasion games is the idea of optimizing certain parameters\, whether they are the search number\, burning number\, or localization number\, for example. We report on progress in several pursuit-evasion games on graphs and conjectures arising from their analysis. Finding the values\, bounds\, and algorithms to compute these graph parameters leads to topics intersecting graph theory\, the probabilistic method\, and geometry.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-anthony-bonato-ryerson-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=UTC:20211013T153000
DTEND;TZID=UTC:20211013T163000
DTSTAMP:20260613T212200
CREATED:20211012T120433Z
LAST-MODIFIED:20211012T120607Z
UID:6327-1634139000-1634142600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Danny Dyer (Memorial University)
DESCRIPTION:Title: The basics of the deduction game \nAbstract: \nThe deduction game is a new variant of the classical chasers and runners game where the chasers are trying to catch an invisible runner quickly\, but with no communication possible between chasers on different vertices. Instead\, chasers may deduce where their fellow chasers *must* move\, and make corresponding adjustments to their own movements. The goal is to use as few chasers as possible\, and in some cases that number is quite high. We will examine some bounds on the deduction number\, determine the deduction number of several classes of graphs\, and pose some open problems. This is joint work with Andrea Burgess and Mozhgan Farahani. \nJoin Zoom Meeting 
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-danny-dyer-memorial-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:20211015T160000
DTEND;TZID=America/Halifax:20211015T170000
DTSTAMP:20260613T212200
CREATED:20200904T115630Z
LAST-MODIFIED:20211014T155748Z
UID:6267-1634313600-1634317200@aarms.math.ca
SUMMARY:Dalhousie-AARMS AAMP Seminar: Ben Landon (University of Toronto)
DESCRIPTION:Title: Local eigenvalue statistics of random matrices and Dyson Brownian motion \nAbstract:  Dyson Brownian motion is a stochastic process describing eigenvalue dynamics under a matrix-valued Brownian motion.  We will review this process and its role in the study of universality of the local\nspectral statistics of random matrices.  We discuss results on the local ergodicity of Dyson Brownian motion and applications\, including local eigenvalue universality of the adjacency matrices of sparse random graphs\nand an additive model related to free probability.  Time permitting\, we also review results on the universality of extremal spectral statistics and the fluctuations of a single eigenvalue in the spectral bulk. \nThe Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 – 5 pm Atlantic Time in Chase 319 on the Dalhousie University campus with some being broadcasted 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/
LOCATION:Zoom seminar
CATEGORIES:AAMP Seminar
ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211020T153000
DTEND;TZID=UTC:20211020T163000
DTSTAMP:20260613T212200
CREATED:20211025T003426Z
LAST-MODIFIED:20211025T003520Z
UID:6454-1634743800-1634747400@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Viresh Patel (University of Amsterdam)
DESCRIPTION:Title: Path decompositions of random directed graphs \nIn this talk we consider the problem of partitioning the edges of a digraph into as few paths as possible. The minimum number of paths needed in such an edge decomposition is called the path number of the digraph. \nThe problem of determining the path number is generally NP-hard. However\, there is a simple (easy to compute) lower bound for the path number of a digraph in terms of its degree sequence\, and a conjecture of Alspach\, Pullman\, and Mason from 1976 states that this lower bound gives the correct value of the path number for any even tournament. The conjecture was recently resolved\, and in this talk I will discuss to what extent the conjecture holds for other digraphs. In particular I will discuss some of the ingredients of a recent result showing that the conjecture holds for almost all digraphs. \nMore generally we will see the conjecture holds with high probability for the random directed graph D_{n\,p} for a large range of p. In fact the proof does not use randomness in a significant way.\n\nThis is joint work with Alberto Espuny Díaz and Fabian Stroh. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-viresh-patel-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=UTC:20211026T110000
DTEND;TZID=UTC:20211026T120000
DTSTAMP:20260613T212200
CREATED:20211019T225913Z
LAST-MODIFIED:20211117T110211Z
UID:6371-1635246000-1635249600@aarms.math.ca
SUMMARY:AARMS Scientific Machine Learning Seminar: Nicholas Touikan (University of New Brunswick)
DESCRIPTION:Group equivariant neural networks seen by a mathematician\nArtificial neural networks (ANNs) are incredibly successful at performing certain machine learning tasks\, such as classification. In applications such as computer vision or quantum chemistry\, we will often seek machine learning algorithms that can handle inputs that are transformed. For example\, a cat detector should be able to detect a rotated cat. \nGroup theory provides the natural formalization of what we mean by transformations and group equivariance is the property we seek in artificial neural networks (ANN) and there is currently a flurry of research activity in group equivariant neural networks. In this talk\, I will present the M.Sc. work of my former student Max Hennick\, which gives a characterization of (approximate) G-equivariant linear mappings. What is most striking is how effective a bit of functional analysis and algebra can be at answering this question. \nI will provide as many examples as possible and conclude with some hopefully interesting questions. \n[ recording ] \nThe AARMS Scientific Machine Learning Seminar takes virtually via WebEx.  If you would like to attend\, please email the organizers for connection details.
URL:https://aarms.math.ca/event/aarms-scientific-machine-learning-seminar-nicholas-touikan-unb/
LOCATION:WebEx seminar
CATEGORIES:AARMS Scientific Machine Learning Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211027T130000
DTEND;TZID=UTC:20211027T150000
DTSTAMP:20260613T212200
CREATED:20211021T095922Z
LAST-MODIFIED:20211021T100309Z
UID:6427-1635339600-1635346800@aarms.math.ca
SUMMARY:Formulating Success: Industry Research Connector 2021
DESCRIPTION:The Formulating Success connector aims to connect Atlantic Canadian companies and not-for-profit organizations with mathematical scientists and statisticians. This is an opportunity for industry and not-for-profits to present data-based challenges; for professors to promote their research with an eye towards establishing partnering opportunities; and for everyone to hear from funding agencies on support mechanisms these collaborations. Rapid-fire 3 minute presentations will enable the understanding of needs\, expertise\, and funding\, and there will be follow-on online networking time to explore future opportunities. \nFree registration at eventbrite.ca
URL:https://aarms.math.ca/event/formulating-success-industry-research-connector-2021/
LOCATION:Zoom seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211027T130000
DTEND;TZID=UTC:20211027T150000
DTSTAMP:20260613T212200
CREATED:20211103T163619Z
LAST-MODIFIED:20211103T163619Z
UID:6484-1635339600-1635346800@aarms.math.ca
SUMMARY:Formulating Success: Industry Research Connector 2021
DESCRIPTION:The Formulating Success connector aims to connect Atlantic Canadian companies and not-for-profit organizations with mathematical scientists and statisticians. This is an opportunity for industry and not-for-profits to present data-based challenges; for professors to promote their research with an eye towards establishing partnering opportunities; and for everyone to hear from funding agencies on support mechanisms these collaborations. Rapid-fire 3 minute presentations will enable the understanding of needs\, expertise\, and funding\, and there will be follow-on online networking time to explore future opportunities. \nRegistration is free at eventbrite.ca
URL:https://aarms.math.ca/event/formulating-success-industry-research-connector-2021-2/
LOCATION:Zoom seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211027T153000
DTEND;TZID=UTC:20211027T163000
DTSTAMP:20260613T212200
CREATED:20211025T002720Z
LAST-MODIFIED:20211025T003603Z
UID:6450-1635348600-1635352200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Guss Regts (University of Amsterdam)
DESCRIPTION:Improved bounds for zeros of the chromatic polynomial on bounded degree graphs\nAbout 20 years ago Sokal proved that there exists a constant C so that for any graph G\, all of the complex zeros of its chromatic polynomial are contained in the disk of radius C Delta(G) centered at 0. (Here Delta(G) denotes the maximum degree of G.) He showed that C could be taken slightly smaller than 8. This was improved to 6.91 by Fernández and Procacci. In this talk I will present an improvement to 5.02 and explain some of the ideas and ingredients of the proof. \nBased on joint work with Maurizio Moreschi\, Viresh Patel and Ayla Stam. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar/
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:20211029T160000
DTEND;TZID=America/Halifax:20211029T170000
DTSTAMP:20260613T212200
CREATED:20200904T115630Z
LAST-MODIFIED:20211020T205857Z
UID:6269-1635523200-1635526800@aarms.math.ca
SUMMARY:Dalhousie-AARMS AAMP Seminar: Perry Kleinhenz (Michigan State University)
DESCRIPTION:Title: Stabilization rates for the damped wave equation with polynomial and oscillatory damping \n\nAbstract: In this talk I will discuss energy decay of solutions of the Damped wave equation. After giving an overview of classical results I’ll focus on the torus with damping that does not satisfy the geometric control condition. In this setup properties of the damping at the boundary of its support determine the decay rate\, however a general sharp rate is not known. \n\n\nI will discuss damping which is $0$ on a strip and vanishes either like a polynomial $x^b$ or an oscillating exponential $e^{-1/x} sin^2(1/x)$. Polynomial damping produces decay of the semigroup at exactly $t^{-(b+2)/(b+3)}$\, while oscillating damping produces decay at least as fast as $t^{-4/5+\delta}$ for any $\delta>0$. I will explain how these model cases are proved and how they direct further study of the general sharp rate. \n\n  \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/
LOCATION:Zoom seminar
CATEGORIES:AAMP Seminar
ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca
END:VEVENT
END:VCALENDAR