Georgia Institute of Technology College of Sciences

The rank-$n$ Dowling geometry $Q_n(\Gamma)$ is a matroid associated with a graph edge-labeled by elements of the finite group $\Gamma$. We determine the maximum size of an $N$-free submatroid of $Q_n(\Gamma)$ for various choices of $N$, including subgeometries $Q_m(\Gamma')$, lines $U_{2,\ell}$, and graphic matroids $M(H)$. When the group $\Gamma$ is trivial and $N=M(K_t)$, this problem reduces to Tur\'{a}n's classical result in extremal graph theory. We show that when $\Gamma$ is nontrivial, a complex dependence on $\Gamma$ emerges, even when $N=M(K_4)$.

This is joint work with Rutger Campbell and Jorn van der Pol.

Using the theory of total linear stability for Dynkin quivers and an interplay between the Bruhat order and the noncrossing partition lattice, we define a family of triangulations of the permutohedron indexed by Coxeter elements.  Each triangulation is constructed to give an explicit homotopy between two complexes (the Salvetti complex and the Bessis--Brady--Watt complex) associated to two different presentations of the corresponding braid group (the standard Artin presentation and Bessis's dual presentation).  Our triangulations have several notable combinatorial properties. In addition, they refine similar Bruhat interval polytope decompositions of Knutson, Sanchez, and Sherman-Bennett. This is based on joint work with Melissa Sherman-Bennett and Nathan Williams. 

Given an $r$-uniform hypergraph $H$, the random Turán number $\mathrm{ex}(G^r_{n,p},H)$ is the maximum number of edges in an $H$-free subgraph of $G^r_{n,p}$, where $G^r_{n,p}$ is the Erdős-Rényi random hypergraph with parameter $p$. In the case when $H$ is not r-partite, the problem has been essentially solved independently by Conlon-Gowers and Schacht. In the case when $H$ is $r$-partite, the degenerate case, only some sporadic results are known.

The Sidorenko conjecture is a notorious problem in extremal combinatorics. It is known that its hypergraph analog is not true. Recently, Conlon, Lee, and Sidorenko discovered a relation between the Sidorenko conjecture and the Turán problem. 

 In this talk, we introduce some recent results on the degenerate random Turan problem and its relation to the hypergraph analog of the Sidorenko conjecture.

In this talk, the speaker will present three applications of information theory in applied spaces. No background on information theory, hypergraphs, or RF signals analysis will be assumed. Bill Kay is a pure mathematician in combinatorics by training who now lives in an applied space at Pacific Northwest National Laboratory.