Past Events

The quantum Bruhat graph is introduced by Brenti-Fomin-Postnikov to study structure constants of the quantum cohomology ring of the flag variety, with very rich combinatorial structures. In this talk, we provide an explicit formula for the minimal...

Generalized geometry, introduced by Hitchin in the early 2000s, has not only grown into a formalism for understanding previously mysterious constructions in physics (especially in supersymmetric sigma models) but has also led to the discovery of new...

There is an interesting connection between chemistry and graph theory. This connection is highlighted by the relationship between a energy of a molecule and the eigenvalues of its graph. In the 1970s, a chemist named Ivan Gutman introduced a concept...

A technique for efficiently describing surfaces was developed to solve the knot recognition problem. This method, using “normal surfaces”, was introduced by Kneser and applied to topological algorithms by Haken. In this talk we will show how normal...

Methane's short lifespan, high Global Warming Potential, and high anthropogenic emissions level make it the most potent greenhouse gas in terms of rapidly reducing global warming. The oil and gas sector is the most significant contributor to methane...

Building trees to represent or to fit distances is a critical component of phylogenetic analysis, metric embeddings, approximation algorithms, geometric graph neural nets, and the analysis of hierarchical data. We summarize several recent efforts to...

Equivariant elliptic cohomology generalizes from equivariant cohomology and equivariant K-theory. It has a rich structure and connections to quantum groups, mathematical physics, enumerative geometry, and algebraic combinatorics. Recently, Okounkov...

Translational tiling is a covering of a space (such as Euclidean space) using translated copies of one building block, called a "translational tile'', without any positive measure overlaps. Can we determine whether a given set is a translational tile...

Using representations of functional data can be more convenient and beneficial in subsequent statistical models than direct observations. These representations, in a lower-dimensional space, extract and compress information from individual curves...

Zero forcing is a combinatorial game played on a graph with the ultimate goal of changing the colour of all the vertices at a minimal cost. Originally this game was conceived as a one-player game, but later a two-player version was devised in...