Research Technology Master Calendar

Title: Even smaller universal posets 

Abstract: Given a family $\mathcal{F}$ of partially ordered sets (posets), we call a poset $Q$ universal for $\mathcal{F}$ if every poset $P \in \mathcal{F}$ can be found inside $Q$ as an induced subposet. A natural question is how small such a universal poset can be when $\mathcal{F}$ is the family of all posets on $n$ elements.

Recent work by Bastide, Groenland, and Nenadov established the existence of a universal poset of size at most $2^{(1+o(1))(3n/2)}$ for this family. In this talk, we improve this bound by constructing a universal poset of size at most $2^{(1+o(1))(n/2)}$.