The positive-density patterns conjecture for affine buildings

Let Δ\Delta be an irreducible affine building with uniform thickness 2q<2\leq q<\infty. Let XVPX\subseteq V_P have positive upper density d(X)>0d^*(X)>0. For each k>0k>0, there exists K=K(X,k)>0K=K(X,k)>0 such that whenever

λ1,,λkQP+\lambda_1,\ldots,\lambda_k\in Q\cap P^+

satisfy λkλ2λ1Kρ\lambda_k\geq\cdots\geq\lambda_2\geq\lambda_1\geq K\rho, there exists a subset {v0,v1,,vk}X\{v_0,v_1,\ldots,v_k\}\subseteq X such that

d(v0,vj)=λjfor all 1jk\boldsymbol{d}(v_0,v_j)=\lambda_j\quad\text{for all }1\leq j\leq k

and

d(o,v0)=d(o,v1)==d(o,vk).\boldsymbol{d}(o,v_0)=\boldsymbol{d}(o,v_1)=\cdots=\boldsymbol{d}(o,v_k).

Positive-density patterns conjecture. Every positive-density subset of the vertex set of an irreducible affine building contains these arbitrarily large prescribed configurations with pairwise vector distances from one distinguished vertex and all vertices lying at the same distance from the base vertex. The preceding theorem establishes the analogous result for (1)(-1)-type affine buildings, while the remark explains that its current formulation fails for non-(1)(-1)-type buildings; the conjecture proposes that the stated formulation remains valid when the prescribed distances lie in QP+Q\cap P^+.

Sources & referencesView supporting material

Primary source

M. Björklund, A. Fish and J. Parkinson, “Patterns in sets of positive density in trees and affine buildings”, arXiv:1907.05825 (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.