Shahriari and Yu's conjecture for forbidden copies of and
Shahriari and Yu's conjecture for forbidden copies of and
Let be a prime power, and let denote the maximum size of a family of subspaces of an -dimensional vector space over containing neither nor as a subposet. Let denote the corresponding sum of the largest Gaussian binomial coefficients. Shahriari and Yu's conjecture. For and ,
The conjecture is a vector-space analogue of a forbidden-poset theorem in the Boolean lattice; the cited paper proves this result using the -analogue of the Lubell–Yamamoto–Meshalkin inequality.
Sources & referencesView supporting material
Primary source
Jimeng Xiao and Casey Tompkins, “On forbidden poset problems in the linear lattice”, arXiv:1905.09246 (2019).
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.