Some exact values of the inducibility and statistics constants for hypercubes

Abstract: We consider two types of problems: maximising, over subsets $S\subseteq {0,1}<sup>n$, the density of $d$-subcubes $C$ in the $n$-hypercube graph that span a subgraph such that $S\cap C$ is i) isomorphic to the given configuration $H\subseteq{0,1}<sup>d$ (the inducibility problem), or ii) has the given size $s$ (the statistics problem). Using flag algebras, we determine the limit of this density as $n\to\infty$ for 5 new configurations $H\subseteq{0,1}<sup>3$ and for 3 new pairs $(d,s)$, namely for $(3,2)$, $(4,2)$ and $(4,4)$. Interestingly, the lower bounds in the last three cases come from blowups of small Hamming codes.