Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 81 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 81 tok/s Pro
Kimi K2 172 tok/s Pro
GPT OSS 120B 430 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Exceptional set estimate through Brascamp-Lieb inequality (2308.07675v2)

Published 15 Aug 2023 in math.CA and math.CO

Abstract: Fix integers $1\le k<n$, and numbers $a,s$ satisfying $0<s<\min{k,a}$. The problem of exceptional set estimate is to determine [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)$ by using Brascamp-Lieb inequality. As one of the corollary, we obtain the estimate [T(a,\frac{k}{n}a)\le k(n-k)-\min{k,n-k}, ] which improves a previous result $T(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)$ for certain $(a,s)$: When $k\le \frac{n}{2}$, $\beta\in(0,1]$ and $\gamma\in(\beta,\frac{k}{n}(1+\beta)]$, we have [T(1+\beta,\gamma)=k(n-k)-k.] When $k\ge \frac{n}{2}$, $\beta\in(0,1]$ and $\gamma\in (\beta, (1-\frac{k}{n})+\frac{k}{n}\beta]$, we have [T(n-1+\beta,k-1+\gamma)=k(n-k)-(n-k).]

Citations (6)

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube