2000 character limit reached
New Subexponential Fewnomial Hypersurface Bounds
Published 2 Oct 2017 in math.AG and cs.CG | (1710.00481v2)
Abstract: Suppose $c_1,\ldots,c_{n+k}$ are real numbers, ${a_1,\ldots,a_{n+k}}!\subset!\mathbb{R}n$ is a set of points not all lying in the same affine hyperplane, $y!\in!\mathbb{R}n$, $a_j\cdot y$ denotes the standard real inner product of $a_j$ and $y$, and we set $g(y)!:=!\sum{n+k}_{j=1} c_j e{a_j\cdot y}$. We prove that, for generic $c_j$, the number of connected components of the real zero set of $g$ is $O!\left(n2+\sqrt{2}{k2}(n+2){k-2}\right)$. The best previous upper bounds, when restricted to the special case $k!=!3$ and counting just the non-compact components, were already exponential in $n$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.