Simon Fraser University

A set of positive integers is called a Diophantine tuple if the product of any two distinct elements in the set is one less than a square. There is a long history and extensive literature on the study of Diophantine tuples and their generalizations...

Classical algorithms are defined on inputs of different sizes. In contrast, data-driven algorithms, that is, algorithms learned from some data, may only be defined on inputs of the same size as the data. What does it mean for an algorithm to be...

In this talk, we study the singularities of secant varieties of smooth projective varieties when the embedding line bundle is sufficiently positive. We give a necessary and sufficient condition for these to have p-Du Bois singularities. In addition...

Derivative-free algorithms seek the minimum of a given function based only on function values queried at appropriate points. Their performance is known to worsen as the problem dimension increases. Recent advances in developing randomized derivative...

In this talk, I introduce several first- and second-order models for self-collective behaviour on general manifolds and discuss their emergent behaviors. For the first-order model, we consider attractive-repulsive and purely attractive interaction...

Carl Jacobi worked in the 1830s at the University of Königsberg on what became known as Hamilton-Jacobi theory, and also on the theory of the second variation in the calculus of variations. The first was a subject in dynamical analysis, while the...

The memory capacity of a statistical model is the largest size of generic data that the model can memorize and has important implications for both training and generalization. In this talk, we will prove a tight memory capacity result for two-layer...

When trying to classify curves over a non-algebraically closed field, one quickly runs into the difficulty that there are curves which are not defined over their fields of moduli. We will explain what this means with some examples. We will discuss...

Adinkras are decorated graphs that encapsulate information about conjectural relationships between fundamental particles in physics. If we color the edges of an Adinkra with a rainbow of shades in a specific order, we obtain a special curve that we...

From a directed graph $Q$, called a quiver, one can construct what is known as a quiver variety $Y_Q$, an algebraic variety defined as a quotient of a vector space by a group defined in terms of $Q$. A mutation of a quiver is an operation that...