Shahriari and Yu's conjecture for forbidden copies of YkY_k and YkY'_k

Let qq be a prime power, and let Laq(n,{Yk,Yk})\mathrm{La}_q(n,\{Y_k,Y'_k\}) denote the maximum size of a family of subspaces of an nn-dimensional vector space over Fq\mathbb{F}_q containing neither YkY_k nor YkY'_k as a subposet. Let Σq(n,k)\Sigma_q(n,k) denote the corresponding sum of the kk largest Gaussian binomial coefficients. Shahriari and Yu's conjecture. For k1k\geq 1 and nk+1n\geq k+1,

Laq(n,{Yk,Yk})=Σq(n,k).\mathrm{La}_q(n,\{Y_k,Y'_k\})=\Sigma_q(n,k).

The conjecture is a vector-space analogue of a forbidden-poset theorem in the Boolean lattice; the cited paper proves this result using the qq-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

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.