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: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
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:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20220218T160000
DTEND;TZID=America/Halifax:20220218T170000
DTSTAMP:20260610T132125
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:20220216T153000
DTEND;TZID=UTC:20220216T163000
DTSTAMP:20260610T132125
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:20220211T160000
DTEND;TZID=America/Halifax:20220211T170000
DTSTAMP:20260610T132125
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:20220209T153000
DTEND;TZID=UTC:20220209T163000
DTSTAMP:20260610T132125
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=UTC:20220202T153000
DTEND;TZID=UTC:20220202T163000
DTSTAMP:20260610T132125
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:20220126T153000
DTEND;TZID=UTC:20220126T163000
DTSTAMP:20260610T132125
CREATED:20220124T120023Z
LAST-MODIFIED:20220124T120023Z
UID:6576-1643211000-1643214600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Andrea Burgess (UNB)
DESCRIPTION:Mutually Orthogonal Cycle Systems\nA $k$-cycle system of order $n$ is a set of $k$-cycles whose edges partition the edge set of $K_n$.  We say that two cycle systems $\mathcal{C}$ and $\mathcal{C}’$ are {\em orthogonal} if every cycle in $\mathcal{C}$ shares at most one edge with each cycle in $\mathcal{C}’$.  Orthogonal cycle systems arise naturally from simple Heffter arrays and biembeddings of cycle decompositions. \nA collection of cycle systems is {\em mutually orthogonal} if any two of the systems are orthogonal.  In this talk\, we give bounds on the number of mutually orthogonal $k$-cycle systems of order $n$ and provide constructions for sets of mutually orthogonal cyclic cycle systems. \nThis is joint work with Nicholas Cavenagh and David Pike. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-andrea-burgess-unb/
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:20220119T153000
DTEND;TZID=UTC:20220119T163000
DTSTAMP:20260610T132125
CREATED:20220116T181412Z
LAST-MODIFIED:20220116T181412Z
UID:6553-1642606200-1642609800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Robert Kooij (Delft University of Technology)
DESCRIPTION:Robustness of Complex Networks \nNetwork Science aims to understand the graph structure of networks and the dynamic processes that take place on networks. Examples of processes on networks are transport of items (IP packets with digitalized  information\, cars\, containers) and diffusion (epidemics\, electric current\, water flows\, human emotions). The Network Architectures and Services Section at the Delft University of Technology contributes to the fundaments of Network Science: we investigate amongst others geometric representations of networks\, epidemic spread on networks\, spectra of  graphs and network algorithms. In addition\, we apply our mathematical knowledge to the design\, management and control of critical  infrastructures\, such as telecom networks and power grids\, in order to make these networks robust\, resilient\, efficient and reliable. In this talk we will give three examples of our results in the field of robustness of complex  networks\, namely robustness with respect to malware spread\, robustness of network controllability and the robustness of a real-world critical infrastructure. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-robert-kooij-delft-university-of-technology/
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:20220112T153000
DTEND;TZID=UTC:20220112T163000
DTSTAMP:20260610T132125
CREATED:20220109T183647Z
LAST-MODIFIED:20220109T183647Z
UID:6550-1642001400-1642005000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Iain Moffat (Royal Holloway\, University of London)
DESCRIPTION:Spanning Trees and Graphs Embedded in Surfaces\n\nTo what extent is a graph determined by the trees contained in it? That is\, if we know the edge sets of each of the spanning trees (i.e.\, maximal acyclic subgraphs) in a connected graph\, then do we know the graph itself? It only takes a little bit of thought to see that the answer is “no” (e.g.\, suppose the graph is a tree).  But this “no” is really a “more or less\, yes”.   A classical result of Whitney states that we know the graph up to some simple moves. \n\nIn this talk we consider what changes if we ask this question not for graphs in the abstract\, but graphs that are embedded on surfaces.  We shall see how this question brings together a seemingly disjoint collection of topics in mathematics and brings new approaches to topological graph theory.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-iain-moffat-royal-holloway-university-of-london/
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:20211208T153000
DTEND;TZID=UTC:20211208T163000
DTSTAMP:20260610T132125
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
BEGIN:VEVENT
DTSTART;TZID=UTC:20211207T110000
DTEND;TZID=UTC:20211207T120000
DTSTAMP:20260610T132125
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=America/Halifax:20211203T160000
DTEND;TZID=America/Halifax:20211203T170000
DTSTAMP:20260610T132125
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:20211201T153000
DTEND;TZID=UTC:20211201T163000
DTSTAMP:20260610T132125
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=UTC:20211123T110000
DTEND;TZID=UTC:20211123T120000
DTSTAMP:20260610T132125
CREATED:20211112T192613Z
LAST-MODIFIED:20211117T110237Z
UID:6497-1637665200-1637668800@aarms.math.ca
SUMMARY:AARMS Scientific Machine Learning Seminar: Ben Adcock (Simon Fraser University)
DESCRIPTION:Title: Tackling the curse: polynomial and deep neural network methods for function approximation in high dimensions \nAbstract: Many problems in computational science and engineering require the accurate approximation of a target function from data. This problem is rendered challenging by the high-dimensionality of the function\, the expense of generating function samples\, the presence of noise in the measurements\, and the fact that the target function may take values in a function space. Developing techniques that tackle these challenges without succumbing to the famous “curse of dimensionality” has been a long-standing problem. In the first part of this talk I will give a brief survey of a decade’s worth of progress on high-dimensional function approximation via sparse polynomial expansions. I will show how the proper use of nonlinear approximation theory and compressed sensing techniques leads to algorithms for high-dimensional approximation which\, unlike other approaches\, possess provably near-optimal error bounds and moderate sample complexities. In particular\, these techniques mitigate the curse of dimensionality to a substantial degree. The second part of the talk will be devoted to emerging approaches based on deep neural networks and deep learning. Such tools are beginning to garner substantial attention in the scientific computing community. Nonetheless\, I will present evidence of a key gap between current theory and practice. I will then discuss recent results showing that there exist deep neural networks that match the performance of best-in-class schemes\, and furthermore\, these can indeed be trained through realizable procedures. This highlights the potential of deep neural networks\, and sheds light on achieving robust\, reliable and overall improved practical performance. \nThis talk is based on joint work with Anyi Bao\, Simone Brugiapaglia\, Juan M. Cardenas\, Nick Dexter\, Sebastian Moraga\, Yi Sui and Clayton G. Webster. \nMeeting link:\nhttps://mun.webex.com/mun/j.php?MTID=m38cc6ce370de2b1c234e33feac5bb93a \nMeeting number: 2630 760 7617\nPassword: cJwPcrHM425
URL:https://aarms.math.ca/event/aarms-scientific-machine-learning-seminar-ben-adcock-sfu/
LOCATION:WebEx seminar
CATEGORIES:AARMS Scientific Machine Learning Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20211119T160000
DTEND;TZID=America/Halifax:20211119T170000
DTSTAMP:20260610T132125
CREATED:20200904T115630Z
LAST-MODIFIED:20211111T152305Z
UID:6297-1637337600-1637341200@aarms.math.ca
SUMMARY:Dalhousie-AARMS AAMP Seminar: Amanda Young (Technical University of Munich)
DESCRIPTION:Title: A bulk gap in the presence of edge states for a HaldanepseudopotentialAbstract: In this talk\, we discuss a recent result on a bulk gap for atruncated Haldane pseudopotential with maximal half filling\, whichdescribes a strongly correlated system of spinless bosons in a cylindergeometry. For this Hamiltonian with either open or periodic boundaryconditions\, we prove a spectral gap above the highly degenerateground-state space which is uniform in the volume and particle number.Our proofs rely on identifying invariant subspaces to which we applygap-estimate methods previously developed only for quantum spinHamiltonians. In the case of open boundary conditions\, the lower boundon the spectral gap accurately reflects the presence of edge states\,which do not persist into the bulk. Customizing the gap technique to theinvariant subspace\, we avoid the edge states and establish a moreprecise estimate on the bulk gap in the case of periodic boundaryconditions. The same approach can also be applied to prove a bulk gapfor the analogously truncated 1/3-filled Haldane pseudopotential for thefractional quantum Hall effect. Based off joint work with S. Warzel. \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-2-3/
LOCATION:Zoom seminar
CATEGORIES:AAMP Seminar
ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20211119
DTEND;VALUE=DATE:20211120
DTSTAMP:20260610T132125
CREATED:20211102T162849Z
LAST-MODIFIED:20211102T162849Z
UID:6479-1637280000-1637366399@aarms.math.ca
SUMMARY:University of New Brunswick Data Challenge
DESCRIPTION:The Data Challenge will bring together three competitive events\, the Open Data Visualization (6th annual)\, Data Analytics (2nd Edition)\, and Data Sprint (2nd Edition) on November 19\, 2021 in a hybrid format – virtually & in-person! Take up the challenge and demonstrate the power of data\, with the flexibility to take part remotely. Our previous edition saw 85 data-driven enthusiasts compete from across Canada in 30 teams. The event also saw 35 business experts\, mentors\, speakers & partners from diverse industries. \nParticipants and teams will have the chance to showcase their ability to tell a story-driven by data in three unique competitive formats. Teams can participate in all three competitive events. It is an ideal setting for citizens to get engaged\, to meet leaders in academia\, government\, and private organizations\, and to explore the world of data science. 
URL:https://aarms.math.ca/event/university-of-new-brunswick-data-challenge/
LOCATION:University of New Brunswick (Fredericton Campus)\, Fredericton\, New Brunswick\, Canada
CATEGORIES:AARMS sponsored events
ORGANIZER;CN="Nandi Kaul":MAILTO:nkaul@unb.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211117T153000
DTEND;TZID=UTC:20211117T163000
DTSTAMP:20260610T132125
CREATED:20211115T114239Z
LAST-MODIFIED:20211115T114239Z
UID:6506-1637163000-1637166600@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Pavol Hell (SFU)
DESCRIPTION:I will discuss a few examples where considering loops leads to interesting insights\, often allowing unifying existing results. These examples will include cops and robbers games\, graph homomorphisms\, variants of interval and chordal graphs\,\nand versions of domination. \nJoin Zoom Meeting: link
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-pavol-hell-sfu/
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:20211109T110000
DTEND;TZID=UTC:20211109T120000
DTSTAMP:20260610T132125
CREATED:20211102T153203Z
LAST-MODIFIED:20211113T004815Z
UID:6474-1636455600-1636459200@aarms.math.ca
SUMMARY:AARMS Scientific Machine Learning Seminar: Hamid Usefi (MUN)
DESCRIPTION:Multicollinearity\, singular vectors\, and dimensionality reduction for high-dimensional datasets\nSingle nucleotide polymorphisms (SNPs) as building blocks of our DNA\, can determine the variations between people. It is believed that SNPs in genes that regulate DNA mismatch repair\, cell cycle regulation\, metabolism and immunity are associated with genetic susceptibility to cancer.  So\, SNPs are potential diagnostic and therapeutic biomarkers in many cancer types. This in part has prompted the rapid advancements in DNA sequencing  which makes it  possible both in terms of cost and time to genetically sequence a single suspect tissue. The number of SNPs in a disease dataset varies from tens of thousands to several million. So\, one of the bottlenecks of working with these genome datasets is their large-scale size that makes it difficult to render the data for meaningful analysis.  Furthermore\, in most diseases\, there are at most a couple of hundred SNPs associated with the disease. So\, simply put we would be looking for a needle in a haystack. \nMachine learning algorithms are gaining increasing attention and believe to have great potential in answering many questions in this respect. A common problem in machine learning and pattern recognition is the process of identifying the most relevant features\, specifically in dealing with high-dimensional datasets in bioinformatics. In this talk\, I will discuss some of our recent work on a new feature selection method\, called Singular-Vectors Feature Selection (SVFS). Part of this work is joint with my recently graduated PhD student Majid Afshar. It is stemmed from identifying linearly dependent columns of a matrix A. This problem can also be viewed as multicollinearity and subset selection in statistical modelling and arises in many contexts\, including regression\, ecology\, and machine learning. \nLet D = [A | b] be a labeled dataset\, where b is the class label and features (attributes or SNPs) are columns of matrix A; rows of A can be viewed as samples. We show with examples as well as a sketch of proof that the projector matrix P_A onto the null space of A can be used to partition the columns of A into clusters so that columns in a cluster correlate only with the columns in the same cluster. In the first step\, SVFS uses the projector P_D to find the cluster that contains b. We reduce the size of A by discarding features in the other clusters as irrelevant features. In the next step\, SVFS uses the P_A of reduced A to partition the remaining features into clusters and choose the most important features from each cluster. I will discuss the  performance of SVFS on genomic datasets compared to the state-of-the-art feature selection methods. \n[ recording ] \n\nMeeting link:  https://mun.webex.com/mun/j.php?MTID=m855b1e73549cf668f5b57190a7ef3eae\nMeeting number:   2633 483 6250\nMeeting password:  W3FisMnJa86\n\n\n 
URL:https://aarms.math.ca/event/aarms-scientific-machine-learning-seminar-hamid-usefi-mun/
LOCATION:WebEx seminar
CATEGORIES:AARMS Scientific Machine Learning Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20211105T160000
DTEND;TZID=America/Halifax:20211105T170000
DTSTAMP:20260610T132125
CREATED:20200904T115630Z
LAST-MODIFIED:20211103T174033Z
UID:6273-1636128000-1636131600@aarms.math.ca
SUMMARY:Dalhousie-AARMS AAMP Seminar: Nina Holden (ETH Zürich and the Courant Institute)
DESCRIPTION:Conformal invariance of percolation on random planar maps\nConformal invariance of critical percolation on the triangular lattice was proved by Smirnov. His proof is hard to extend to critical percolation on other lattices since his proof relies on a combinatorial identity which is only true on the triangular lattice. On random lattices known as random planar maps\, however\, it turns out that conformal invariance can be established. This was done in joint work with Sun\, building on our earlier works with Albenque\, Bernardi\, Garban\, Gwynne\, Lawler\, Li\, and Sepulveda. \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-2/
LOCATION:Zoom seminar
CATEGORIES:AAMP Seminar
ORGANIZER;CN="Suresh Eswarathasan":MAILTO:sr766936@dal.ca
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20211103T153000
DTEND;TZID=UTC:20211103T163000
DTSTAMP:20260610T132125
CREATED:20211031T172611Z
LAST-MODIFIED:20211031T172611Z
UID:6472-1635953400-1635957000@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Jo Ellis-Monaghan (University of Amsterdam)
DESCRIPTION:2017 saw the centennial of William Tutte\, one of the greatest mathematicians of modern times.  One of the testimonies to Tutte’s genius is that nearly everything he did proved to be a catalyst\, triggering an explosion of further investigations and opening whole new vistas of mathematics.  The Tutte polynomial is one of many such examples in his legacy.   Here we will explore some of its salient properties and some of the many directions that propagated outward from the original Tutte polynomial.  These include several ways in which the Tutte polynomial may be defined and its universality\, as well as some of its combinatorial and algebraic properties.  We will showcase information encoded in the Tutte polynomial as evaluations and specializations\, as these inform nearly every aspect of combinatorics.   Furthermore\, the scope of the Tutte polynomial is continually broadening through generalizations of either its domain or parameter space\, and we will highlight some important examples\, and touch on its interrelations with other combinatorial polynomials.  We will conclude with its particularly fruitful connections with biology and the Potts model of statistical mechanics\, and offer some open questions.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-jo-ellis-monaghan-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:20211029T160000
DTEND;TZID=America/Halifax:20211029T170000
DTSTAMP:20260610T132125
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
BEGIN:VEVENT
DTSTART;TZID=UTC:20211027T153000
DTEND;TZID=UTC:20211027T163000
DTSTAMP:20260610T132125
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=UTC:20211027T130000
DTEND;TZID=UTC:20211027T150000
DTSTAMP:20260610T132125
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:20211027T130000
DTEND;TZID=UTC:20211027T150000
DTSTAMP:20260610T132125
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:20211026T110000
DTEND;TZID=UTC:20211026T120000
DTSTAMP:20260610T132125
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:20211020T153000
DTEND;TZID=UTC:20211020T163000
DTSTAMP:20260610T132125
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=America/Halifax:20211015T160000
DTEND;TZID=America/Halifax:20211015T170000
DTSTAMP:20260610T132125
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:20211013T153000
DTEND;TZID=UTC:20211013T163000
DTSTAMP:20260610T132125
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=UTC:20211006T153000
DTEND;TZID=UTC:20211006T163000
DTSTAMP:20260610T132125
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;VALUE=DATE:20210921
DTEND;VALUE=DATE:20210924
DTSTAMP:20260610T132125
CREATED:20210909T215846Z
LAST-MODIFIED:20210914T192646Z
UID:6250-1632182400-1632441599@aarms.math.ca
SUMMARY:Atlantic Algebra Centre Minicourse: Introduction to Schubert calculus via (nil-)Hecke algebras
DESCRIPTION:Professor Kirill Zaynullin (University of Ottawa)\nFrom September 20 to September 23\, 2021\, Professor Kirill Zaynullin from the University of Ottawa will give an introductory mini- course on nil-Hecke algebras and their applications in cohomology. \nThe mini-course will consist of four lectures and will give a self-contained exposition on the use of the techniques of nil-Hecke algebras in the equivariant Schubert calculus for cohomology of flag varieties. \nThe first part will discuss root datum and Coxeter groups (Lectures 1-2): definition of a root datum\, simple roots\, fundamental weights and the Cartan matrix\, the Dynkin diagram\, the Weyl group\, geometric realization\, finite real root systems\, coefficient ring of a root system\, non-crystallographic root datum. \nThe second part will introduce nil-Hecke rings and twisted group algebras (Lectures 2-3): definition of nil-Coxeter and nil-Hecke rings\, twisted group algebras and their localizations\, coproducts\, Hecke and Weyl actions\, characteristic and the Borel maps. \nThe third part (Lectures 3-4) will relate nil-Hecke rings and the Schubert calculus techniques: push-pull elements and divided- difference operators\, the coproduct and the actions\, faithful representation\, the augmented coproduct and the formula for the coproduct\, the dual of the nil-Hecke ring and equivariant cohomology. \nThe lectures will take place at the St. John’s campus of Memorial University and will be broadcast via Zoom. The schedule is tentatively: \n\nTuesday\, Sep. 21: 9-9:50 am and 3-3:50 pm (Atlantic time)\nWednesday\, Sep. 22: 9-9:50 am (Atlantic time)\nThursday\, Sep. 23: 9-9:50 am (Atlantic time)\n\nFor Zoom connection details and last minute schedule changes\, see the event website.
URL:https://aarms.math.ca/event/atlantic-algebra-centre-minicourse-introduction-to-schubert-calculus-via-nil-hecke-algebras/
LOCATION:Zoom seminar
ATTACH;FMTTYPE=image/png:https://aarms.math.ca/wp-content/uploads/2021/09/kirill.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Halifax:20210920T150000
DTEND;TZID=America/Halifax:20210920T163000
DTSTAMP:20260610T132125
CREATED:20200615T150024Z
LAST-MODIFIED:20211102T194406Z
UID:6167-1632150000-1632155400@aarms.math.ca
SUMMARY:AARMS COVID-19 Seminar:  Theodore Kolokolnikov (Dalhousie)
DESCRIPTION:Modelling of disease spread through heterogeneous population\nWe present a simple model of disease spread that incorporates spatial variability in population density. Starting from first principles\, we derive a novel PDE with state-dependent diffusion. Consistent with observations\, this model exhibits higher infection rates in the areas of higher population density. The model also exhibits an infection wave whose speed varies with population density. In addition\, we demonstrate the possibility of super-diffusive propagation of infection\, whereby an infection can “jump” across areas of low population density towards the areas of high population density. Finally\, a case study of coronavirus spread in the Canadian province of Nova Scotia is presented with qualitatively similar features as our model\, including density-dependent infection rates and infection that jumps across main population centers. \n[ recording ] \nMore information about this seminar series.  This is a virtual zoom seminar.  If you would like to attend\, please email the organizers for connection details.  All times are given in the Atlantic timezone.
URL:https://aarms.math.ca/event/aarms-covid-19-seminar-2021-09-20/
LOCATION:Zoom seminar
END:VEVENT
END:VCALENDAR