Past Events

For a simple graph $G$ on $n$ vertices, let $\mathcal{S}(G)$ be the set of all $n\times n$ real symmetric matrices $A=[a_{i,j}]$ with $a_{i,j}\neq 0$ if and only if $\{i,j\}$ is an edge of $G$. There are no restrictions on the diagonal entries of $A$...

Deep learning-based approaches have succeeded surprisingly in various fields of sciences. In particular, one of the first and most successful achievements of them is image classification. Now, deep learning-based algorithms perform even better than...

In Allen's talk, we learned that the deformations of an algebra A can be classified by certain Hochschild cohomology classes. In this talk, we will see that the Hochschild cochains of A can be endowed with a differential graded (DG) Lie algebra...

One of the central questions in developmental biology is how organs form in the correct positions in order to create a functional mature organism. Plant leaves offer an easily observable example of organ positioning, with species-specific motifs for...

In this talk, I will summarize the research on enriched algebraic theories, monads, and varieties that I produced with Rory Lucyshyn-Wright during my previous postdoctoral fellowship at Brandon University. I will start by providing a historical...

In this talk, I will present the recent progress of understanding adversarial multiclass classification problems, motivated by the empirical observation of the sensitivity of neural networks by small adversarial attacks. From the perspective of...

TBC

I will introduce the Monomer-Dimer model, a Gibbs probability measure on the space of (not necessarily perfect) weighted matchings on a graph. I will recap some known results of Heilmann and Lieb which establish the absence of a phase transition. I...

In 1979, Erdős conjectured that for k≥9, 2k is not the sum of distinct powers of 3. That is, the set of powers of two (which is 2-automatic) and the 3-automatic set consisting of numbers whose ternary expansions omit 2 has finite intersection. In the...

In this talk we consider the injective chromatic index and the oriented chromatic number of graphs with bounded Euler genus. In particular, we present our proofs of a tight (up to the choice of little o(1)) bound on the injective chromatic index in...