Past Events

ELMACON is an annual math contest for students in grades 5, 6, and 7. Students tackle hard mathematical questions in an competitive environment to determine who will take home trophies and prizes. The contest is designed to be challenging but fun. It...

In this talk, we discuss pair state transfer on graphs with respect to the adjacency matrix. We show that the evolution of certain pair states in a quantum network with isomorphic branches depends solely on the local structure, and it remains...

PLEASE NOTE: The room number for this session is not yet known, but it will take place at UBC's Point Grey campus. The location in the sidebar will be updated as soon as it is known. Students of grades 5 to 7 are invited to challenge and develop...

We consider a magnetized plasma (in the case of a tokamak) where the density of ions $ n_0$ as well as the imposed vertical magnetic field $B_0$ dépend on the horizontal variable $x$. The linearized system of Euler-Maxwell équations (system of 10...

One of my favorite quotations in mathematics is due to Titchmarsh, who remarked: “The finer theory of the partial sums of the Möbius function is extremely obscure, and the results are not nearly so precise as the corresponding ones in the prime...

For a standard-graded polynomial ring R, the d-Veronese subring is generated as a k-algebra by degree d monomials, is Koszul, and its defining ideal is quadratic, binomial, and determinantal. In this talk, I will discuss what happens if we instead...

A fundamental problem in artificial intelligence is how to simultaneously deploy data from different sources, such as audio, images, text, and video, collectively known as multimodal data. In this talk, I will present a mathematical framework for...

Let F be a homogeneous polynomial of degree n in at least d 2 + 1 variables over the p-adic numbers, Q p . Artin conjectured that such F always have nontrivial zeros in any p -adic field. Although this has been shown to be false in general, the...

Graph toughness, introduced by Chvátal in 1973, is a key measure of how well different parts of a graph are connected, with implications for Hamiltonicity, spanning trees, connectivity, and more. We derive new bounds on graph toughness and confirm...

Latent Dirichlet Allocation and Text embeddings have revolutionized the use of text as data leading to vastly improved document clustering and retrieval and recommender systems by finding lower dimensional structure in the text. Furthermore, these...