English

Exceptional set estimate through Brascamp-Lieb inequality

Classical Analysis and ODEs 2024-02-12 v2 Combinatorics

Abstract

Fix integers 1k<n1\le k<n, and numbers a,sa,s satisfying 0<s<min{k,a}0<s<\min\{k,a\}. The problem of exceptional set estimate is to determine T(a,s):=supARn dimA=adim({VG(k,n):dim(πV(A))<s}).T(a,s):=\sup_{A\subset \mathbb{R}^n\ \text{dim}A=a}\text{dim}(\{ V\in G(k,n): \text{dim}(\pi_V(A))<s \}). In this paper, we prove a new upper bound for T(a,s)T(a,s) by using Brascamp-Lieb inequality. As one of the corollary, we obtain the estimate T(a,kna)k(nk)min{k,nk},T(a,\frac{k}{n}a)\le k(n-k)-\min\{k,n-k\}, which improves a previous result T(a,kna)k(nk)1T(a,\frac{k}{n}a)\le k(n-k)-1 of He. By constructing examples, we can determine the explicit value of T(a,s)T(a,s) for certain (a,s)(a,s): When kn2k\le \frac{n}{2}, β(0,1]\beta\in(0,1] and γ(β,kn(1+β)]\gamma\in(\beta,\frac{k}{n}(1+\beta)], we have T(1+β,γ)=k(nk)k.T(1+\beta,\gamma)=k(n-k)-k. When kn2k\ge \frac{n}{2}, β(0,1]\beta\in(0,1] and γ(β,(1kn)+knβ]\gamma\in (\beta, (1-\frac{k}{n})+\frac{k}{n}\beta], we have T(n1+β,k1+γ)=k(nk)(nk).T(n-1+\beta,k-1+\gamma)=k(n-k)-(n-k).

Keywords

Cite

@article{arxiv.2308.07675,
  title  = {Exceptional set estimate through Brascamp-Lieb inequality},
  author = {Shengwen Gan},
  journal= {arXiv preprint arXiv:2308.07675},
  year   = {2024}
}

Comments

28 pages, journal version

R2 v1 2026-06-28T11:55:55.627Z