Events Search and Views Navigation
January 2023
The 19th Seminar on Commutative Algebra and related topics
Every year the school of mathematics of IPM-Tehran organizes a seminar and workshop to introduce the research topics in the main streams of "Algebraic Geometry, Commutative algebra and Combinatorial commutative algebra" to young researchers and PhD students, and encourage them to collaborate in teams led by well-known mathematicians in this area. This year we have paid special attention to inviting regional speakers, as well as international leaders. Our list of speakers highlights female mathematicians, and the areas represented are those…
Find out more »Atlantic Graph Theory Seminar: Pawel Pralat, Metropolitan University of Toronto
An Unsupervised Framework for Comparing Graph Embeddings The goal of many machine learning applications is to make predictions or discover new patterns using graph-structured data as feature information. In order to extract useful structural information from graphs, one might want to try to embed it in a geometric space by assigning coordinates to each node such that nearby nodes are more likely to share an edge than those far from each other. There are many embedding algorithms (based on techniques…
Find out more »Dalhousie-AARMS AAMP Seminar: Andrea Bertozzi (UCLA)
Title: Energy Minimizing Surface Tension Configurations for Microparticles Abstract: An important area of microfluidics is the creation and manipulation of small droplets. This is commonly done using microchannels or electrowetting. Recently a new method is proposed to create templated droplets using amphiphilic microparticles. These particles are observed to hold nearly equal volumes of aqueous liquid when dispersed in an oil–water mixture. However a theory for this behavior is lacking. In this paper, we present a mathematical model based on minimizing the…
Find out more »Atlantic Graph Theory Seminar: Jane (Pu) Gao, University of Waterloo
Conditions for perfect matchings in random sparse bipartite graphs Given a uniformly random sparse matrix A, with specified number of nonzero entries in columns and rows, we determine when A has full row rank over a finite field. As a corollary, by considering A as the adjacency matrix of a bipartite graph, our result determines the conditions for the existence of a perfect matching in various models of random sparse bipartite graphs. We will explore some useful insight from statistical…
Find out more »Dalhousie-AARMS AAMP Seminar: Chamsol Park (Johns Hopkins University)
Title: Eigenfunction restriction estimates on curves with nonvanishing geodesic curvatures Abstract: Studying eigenfunctions of the Laplace-Beltrami operator on compact Riemannian manifolds (without boundary) is one of the interesting topics in Harmonic Analysis. One way to study them is to consider the L^p estimates of the eigenfunctions restricted to submanifolds. In this talk, we briefly summarize previous results and would like to talk about the logarithmic improved analogue for the restriction to curves with nonvanishing geodesic curvatures, in the presence of nonpositive…
Find out more »Dalhousie-AARMS AAMP Seminar: Alex Barnett (Flatiron Institute, NYC)
Title: Equispaced Fourier representations for efficient Gaussian process regression from a billion data pointsAbstract: Gaussian process regression is widely used in geostatistics, time-series analysis, and machine learning. It infers an unknown continuous function in a principled fashion from noisy measurements at $N$ scattered data points. The prior on the function is Gaussian, with covariance given by some user-chosen translationally invariantkernel. Yet $N$ has been limited to about $10^6$, even with modern low-rank methods. Focusing on low spatial dimension (1--3), we present…
Find out more »February 2023
Atlantic Graph Theory Seminar: Jason Brown, Dalhousie University
Colourings, Polynomials and Roots A lot has happened since graph colourings first arose as an applied problem in cartography – do four colours always suffice to distinguish countries when colouring a map? Along the way to the proof, the related enumeration function to count the number of k-colourings was proposed. While the latter didn’t help much in the quest for the Four Colour Theorem, it did lead to a fascinating branch of graph theory, namely chromatic polynomials. While polynomials are…
Find out more »Dalhousie-AARMS AAMP Seminar: Victor Ivrii (U. Toronto)
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 »Atlantic Graph Theory Seminar: Jérémie Turcotte, Université de Montréal
Progress towards the Burning Number Conjecture The burning number b(G) of a graph G is the smallest integer k such that G can be covered by k balls of radii respectively 0,...,k-1, and was introduced independently by Brandenburg and Scott at Intel as a transmission problem on processors and Bonato, Janssen and Roshanbin as a model for the spread of information in social networks. The Burning Number Conjecture claims that b(G)<=\lceil\sqrt{n}\rceil, where n is the number of vertices of G. This bound is tight for paths. The previous best bound for this problem, by Bastide…
Find out more »Minicourse: Group Graded Azumaya Algebras and Generic Constructions
Taught by Professor Eli Aljadeff, Technion University, Israel The main theme of this mini-course is gradings by finite groups on finite-dimensional algebras. Similar to the classical situation of ungraded algebras, we will be interested in finite-dimensional graded simple algebras and finite-dimensional graded division algebras. An important role is played by a generalization of central simple algebras, called Azumaya algebras. Our main tool will be polynomial identities and, in particular, graded polynomial identities. This tool will allow us to construct generic graded…
Find out more »