Past Events

Zarankiewicz's problem in extremal graph theory asks for the maximum number of edges in a bipartite graph on $n$ vertices which does not contain a copy of $K_{k,k}$, the complete bipartite with $k$ vertices in both classes. We will consider this...

Accessibility is a fundamental tool when working with partially hyperbolic systems. For instance, in the 1970s it was used as a tool to show certain systems were transitive, and in the 1990s it was used to establish stable ergodicity. We will review...

TBA

In this talk, we will discuss how to improve the trivial upper bound on the clique number of Paley graphs and generalized Paley graphs using a different method. I will revisit the direction set determined by a Cartesian product in an affine Galois...

Going back to the foundation work of von Neuman there is a question of whether there are smooth models of the models of classical ergodic theory. When both measure and map are required to be smooth there is only one known obstruction but essentially...

For any \(r\geq 2\), an \(r\)-uniform hypergraph \(\mathcal{H}\), and integer \(n\), the Turán number for \(\mathcal{H}\) is the maximum number of hyperedges in any \(r\)-uniform hypergraph on \(n\) vertices containing no copy of \(\mathcal{H}\)...

For any $r\geq 2$, an $r$-uniform hypergraph $\mathcal{H}$, and integer $n$, the \emph{Tur\'{a}n number} for $\mathcal{H}$ is the maximum number of hyperedges in any $r$-uniform hypergraph on $n$ vertices containing no copy of $\mathcal{H}$. While...

Many systems exhibit a digit bias. For example, the first digit base 10 of the Fibonacci numbers or of 2^n equals 1 about 30% of the time; the IRS uses this digit bias to detect fraudulent corporate tax returns. This phenomenon, known as Benford's...

The first half of this talk will be a gentle introduction to the Erdős–Ko–Rado (EKR) Theorem. This is a theorem that determines the size and structure of the largest collection of intersecting sets. It has become a cornerstone of extremal set theory...

Abstract: A broad class of convex geometry problems deals with questions on retrieval of information about (convex) sets from data about different types of their projections, sections, or both. Examples of such assumptions are volume estimates...