Events Search and Views Navigation
October 2021
Atlantic Graph Theory Seminar: Anthony Bonato (Ryerson University)
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. Central to pursuit-evasion games is the idea of optimizing certain parameters, whether they are the search number, burning number, or localization number, for example.…
Find out more »Atlantic Graph Theory Seminar: Danny Dyer (Memorial University)
Title: The basics of the deduction game Abstract: The 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…
Find out more »Dalhousie-AARMS AAMP Seminar: Ben Landon (University of Toronto)
Title: Local eigenvalue statistics of random matrices and Dyson Brownian motion Abstract: 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 spectral 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 and an additive model related to free…
Find out more »Atlantic Graph Theory Seminar: Viresh Patel (University of Amsterdam)
Title: Path decompositions of random directed graphs In 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. The 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…
Find out more »AARMS Scientific Machine Learning Seminar: Nicholas Touikan (University of New Brunswick)
Group equivariant neural networks seen by a mathematician Artificial 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. Group theory provides the natural formalization of what we mean by transformations and group equivariance is the property we seek…
Find out more »Formulating Success: Industry Research Connector 2021
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…
Find out more »Formulating Success: Industry Research Connector 2021
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…
Find out more »Atlantic Graph Theory Seminar: Guss Regts (University of Amsterdam)
Improved bounds for zeros of the chromatic polynomial on bounded degree graphs About 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…
Find out more »Dalhousie-AARMS AAMP Seminar: Perry Kleinhenz (Michigan State University)
Title: Stabilization rates for the damped wave equation with polynomial and oscillatory damping Abstract: 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. I will discuss damping…
Find out more »November 2021
Atlantic Graph Theory Seminar: Jo Ellis-Monaghan (University of Amsterdam)
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…
Find out more »