# Combinatorics and Discrete Probability Seminar: Realizability of Hypergraphs and High-Dimensional Contingency Tables from Random Partitions, by Nicholas Christo

October 2, 2024

4:00 PM - 4:50 PM

Nicholas Christo (UIC): Realizability of Hypergraphs and High-Dimensional Contingency Tables from Random Partitions

A theorem due to Erd\H{o}s and Gallai fully answers the question of when one can realize a provided integer sequence as the degree sequence of a graph with an easy-to-check, necessary and sufficient condition. If one considers a random integer partition as the provided integer sequence, a theorem of Pittel's shows that with high probability a random partition is not the degree sequence of a graph. We consider the analogous question for 3-uniform hypergraphs and show that with high probability a random partition can indeed be realized as the degree sequence of a 3-uniform hypergraph. We will further consider the realizability question of whether one can realize three random integer partitions as the marginals of an associated three-dimensional contingency table. We will briefly discuss how this latter result resolves two conjectures of Pak and Panova regarding Kronecker coefficients

Please click here to make changes to, or delete, this seminar announcement.

## Date posted

Oct 7, 2024

## Date updated

Oct 7, 2024