The diamond-free family conjecture for the subspace lattice
The diamond-free family conjecture for the subspace lattice
Let be the lattice of subspaces of , and let denote the diamond poset. Write for the maximum size of a family of subspaces of containing no copy of . Diamond-free subspace-family conjecture.
The two middle levels provide a lower bound of , whereas the best upper bound stated in the paper has leading constant ; 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.