Past Events

Random geometric graphs were invented by E.N. Gilbert in 1961 to model communications networks. Bootstrap percolation was invented by Chalupa, Leath and Reich in 1979 to model magnetism. Both models have since been used to study many other things...

Cell-free protein synthesis systems (CFPSS) constitute a powerful tool to study translation dynamics. We consider two different eukaryotic CFPSS (extracted from Rabbit Reticulocyte and Plasmodium Falciparum lysates), and compare how their translation...

Schrödinger operators with delta potentials are of longstanding interest for admitting solutions expressible in closed analytic forms. By some duality, these operators also receive new interest for solving moments of the continuum directed random...

In many biological systems, it is essential for individuals to gain information from their local environment before making decisions. In particular, through sight, hearing or smell, animals detect the presence of other individuals and adjust their...

In this talk, we describe the construction of the Bockstein spectral sequence through an exact couple. Also we present an application of the Bockstein spectral sequence in algebraic topology.

In this talk we will present a method to study the Galois group of certain polynomials defined over ℚ. Our approach is similar in spirit to some previous work of F. Hajir, who studied, more than a decade ago, the generalized Laguerre polynomials...

In this talk, we consider analogs of Jaeger's circular flow conjecture and its dual Jaeger-Zhang conjecture in signed graphs. We will first give the notions of circular coloring and circular flow in signed graphs, and then show that every (6k-2)-edge...

The first two problems are concerning edge-colorings of complete graphs. Erd\H{o}s and Tuza asked in 1993 whether for any graph F on l edges and any completely balanced coloring of any sufficiently large complete graph using l colors contains a...

The Szemeredi-Trotter Incidence Theorem, a central result in geometric combinatorics, bounds the number of incidences between n points and m lines in the Euclidean plane. Replacing lines with circles leads to the unit distance problem, which asks how...

Detecting differences and building classifiers between distributions, given only finite samples, are important tasks in a number of scientific fields. Optimal transport (OT) has evolved as the most natural concept to measure the distance between...