Events Search and Views Navigation
March 2023
Atlantic Graph Theory Seminar: Caleb Jones and Rylo Ashmore (Memorial University)
Speaker 1: Caleb Jones, Memorial University Title: Extending Graph Burning to Hypergraphs Abstract: We introduce a round-based model much like graph burning which applies to hypergraphs. The rules for this new model are very natural,and generalize the original model of graph burning. We also introduce a variant called lazy hypergraph burning, along with a new parameter, the lazy burning number. Interestingly, lazily burning a graph is trivial, while lazily burning a hypergraph can be quite complicated. Moreover, the lazy burning model is…
Find out more »Dalhousie-AARMS AAMP Seminar: Milivoje Lukic (Rice U.)
Title: Universality limits for orthogonal polynomialsAbstract: It is often expected that the local statistical behavior ofeigenvalues of some system depends only on its local properties; forinstance, the local distribution of zeros of orthogonal polynomials shoulddepend only on the local properties of the measure of orthogonality. Thisphenomenon is studied using an object called the Christoffel-Darbouxkernel. The most commonly studied case is known as bulk universality,where the rescaled limit of Christoffel-Darboux kernels converges to thesine kernel.In this talk, we will survey this…
Find out more »Atlantic Graph Theory Seminar: Mohammad Salavatipour, U. Alberta
Approximation Schemes for Resource Minimization for Fire Containment Resource Minimization Fire Containment (RMFC) is a natural model for optimal inhibition of harmful spreading phenomena on a graph. In the RMFC problem on trees, we are given an undirected tree G, and a vertex r where the fire starts at, called root. At each time step, the firefighters can protect up to B vertices of the graph while the fire spreads from burning vertices to all their neighbors that have not…
Find out more »Atlantic Graph Theory Seminar: Calum MacRury, University of Toronto
Approximation Schemes for Resource Minimization for Fire Containment The semi-random graph process is an example of an adaptive process for constructing a graph in which random edges are added step by step. It is adaptive in that there is an online algorithm which has partial control over which random edges are added. Through intelligent decision-making, the objective of the algorithm is to force the graph to satisfy a fixed graph property with high probability in as few rounds as possible. We first…
Find out more »Dalhousie-AARMS AAMP Seminar: Erick Schulz (ETH Zürich)
Title + Abstract: TBD The Dalhousie-AARMS Analysis-Applied Math-Physics Seminar takes place on Fridays from 4 - 5 pm Atlantic Time over either Zoom and/or in Chase 227 depending on the speaker. If you would like to attend, please email the organizers for connection details.
Find out more »May 2023
Topological Quantum Field Theory Spring School
Topological Quantum Field Theory lives at the intersection of category theory, algebraic topology, representation theory, and theoretical physics. Physically, TQFTs describe and control the symmetries of quantum systems, including quantum symmetries, anomalous symmetries, and higher-form symmetries. Mathematically, TQFTs provide a dictionary between manifold topology and structures in representation theory, and as such allow computations and results to move between these separate fields. This school, aimed at math PhD students from Atlantic Canada, will consist of three 5-hour minicourses related to…
Find out more »East Coast Combinatorics Conference 2023
The East Coast Combinatorics Conference is a 2-day annual event that brings together researchers in graph theory, design theory, and other areas of combinatorics. There will be two plenary speakers, and a number of contributed talks, in addition to opportunities for collaboration. The event brings together established researchers and those in the early stages of their academic careers and provides opportunities for subsequent collaborative research projects. We encourage participation by students since they greatly benefit from the opportunity to meet…
Find out more »June 2023
Canadian Discrete and Algorithmic Mathematics conference
The Canadian Discrete and Algorithmic Mathematics (CanaDAM) is the pre-eminent conference in its area in Canada. It has been held every two years since its founding in 2009. The general topic of the conference is the theory and application of discrete structures; the goal is to highlight the most salient trends in the field. CanaDAM will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact. Particular areas of interest include graphs and digraphs, hypergraphs, matroids,…
Find out more »Theory Canada 15
Theory Canada is an annual meeting which brings together Canadian theorists from across the country in order to foster collaborations and exchange of ideas across the disciplines of theoretical physics. It is organized by the Division of Theoretical Physics of the Canadian Association of Physicists (CAP). Theory Canada 15 will be held at Mount Allison University from June 16-18, 2023, just before the main CAP meeting which will be in Fredericton.
Find out more »July 2023
Junior Math and Computer Science Camp
This week-long day camp is an opportunity for students entering grades 5 or 6 in the Annapolis Valley to participate in fun and enriching science-based activities with Acadia faculty and students to develop their curiosity and enjoyment of math and computer science. It represents an important piece of a multi-year plan to develop the science skills of young students in the Annapolis Valley by bringing young students into the Acadia University outreach program. This will begin the process of positively…
Find out more »