Low rank approximation of polynomials
Abstract
Let k≤ n. Each polynomial p∈[x1,...,xn] can be uniquely written as p=Σμμ pμ, where μ ranges over the set M of all monomials in [x1,...,xk] and where pμ∈[xk+1,...,xn]. If p is d-homogeneous and >0, we say that p is -concentrated on the first k variables if Σμ∈ M(μ)<dx∈n-k\|x\|=1pμ(x)2≤\|p\|2, where \|p\| is the Bombieri norm of p. We show that for each d∈ and >0 there exists kd, such that for each n and each d-homogeneous p∈[x1,...,xn] there exists k≤ kd, such that p is -concentrated on the first k variables after some orthogonal transformation of n. (So kd, is independent of the number n of variables.) We derive this as a consequence of a more general theorem on low rank approximation of polynomials.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.