Past Events

Students of grades 5 to 7 are invited to challenge and develop their thinking and creativity skills at the Math Circle Workshops. This is an enrichment program for students organized by the faculty members of the Department of Mathematics at the...

Davies's efficient covering theorem states that we can cover any measurable set in the plane by lines without increasing the total measure. This result has a dual formulation, known as Falconer's digital sundial theorem, which states that we can...

The topic on the distribution of sequences saw its light with the seminal paper of Weyl. While the classical notion of equidistribution modulo one addresses the “global” behaviour of the fractional parts of a sequence, quantities such as k-point...

The field of algebraic topology has exposed deep connections between topology and algebra. One example of such a connection comes from algebraic K-theory. Algebraic K-theory is an invariant of rings, defined using tools from topology, that has...

Mean-field game (MFG) systems provide a powerful framework for modeling the collective behavior of multi-agent systems with diverse applications. However, unknown parameters pose challenges. In this work, we tackle an inverse problem, recovering MFG...

The category of polynomial functors in one variable and natural transformations between them is incredibly rich, e.g. it has infinitely many monoidal closed structures, including cartesian closure. Its substitution comonoids are categories and the...

In 1986, Wilf posed the following question ``Which graphs have eigenvectors with entries solely -1 and +1?''. Stevanovic (2016) showed that the problem of finding such graphs is NP-Hard. Caputo, Khames, and Knippel (2019) described all graphs whose...

Plato and Aristotle stated different conceptions of the good: mathematical order vs. human flourishing. These come together to the extent that mathematics promotes life, that mathematical language enables collectives to make sense of the world and...

If A and B are two geometric progressions, we characterize all 3-term arithmetic progressions in the sumset A+B. Somewhat surprisingly, while mostly elementary, this appears to require quite deep machinery from Diophantine Approximation.

Given graphs $G$ and $H$ and a positive integer $q$, an $(H,q)$-coloring of $G$ is an edge-coloring in which each copy of $H$ receives at least $q$ colors. Erdős and Shelah raised the question of determining the minimum number of colors, $f(G,H,q)$...