The diamond-free family conjecture for the subspace lattice

Let Ln(q)\mathcal{L}_{n}(q) be the lattice of subspaces of Fqn\mathbb{F}_{q}^{n}, and let Q2\mathcal{Q}_{2} denote the diamond poset. Write exq(n,Q2)ex_{q}(n,\mathcal{Q}_{2}) for the maximum size of a family of subspaces of Fqn\mathbb{F}_{q}^{n} containing no copy of Q2\mathcal{Q}_{2}. Diamond-free subspace-family conjecture.

exq(n,Q2)=2[nn/2].ex_{q}(n,\mathcal{Q}_{2})=2\genfrac{[}{]}{0pt}{}{n}{\lfloor n/2\rfloor}.

The two middle levels provide a lower bound of (2o(1))[nn/2](2-o(1))\genfrac{[}{]}{0pt}{}{n}{\lfloor n/2\rfloor}, whereas the best upper bound stated in the paper has leading constant (2+3)/2<2.20711(\sqrt{2}+3)/2<2.20711; the conjectured exact asymptotic remains open.

Sources & referencesView supporting material

Primary source

Jiuqiang Liu and Guihai Yu, “A Relationship for LYM Inequalities between Boolean Lattices and Linear Lattices with Applications”, arXiv:2403.04817 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.