New Subexponential Fewnomial Hypersurface Bounds

10/02/2017
by   Jens Forsgård, et al.
0

Suppose c_1,...,c_n+k are real numbers, {a_1,...,a_n+k}⊂R^n is a set of points not all lying in the same affine hyperplane, y∈R^n, a_j· y denotes the standard real inner product of a_j and y, and we set g(y):=∑^n+k_j=1 c_j e^a_j· y. We prove that, for generic c_j, the number of connected components of the real zero set of g is O(n^2+√(2)^k^2(n+2)^k-2). 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2023

Improved estimates on the number of unit perimeter triangles

We obtain new upper and lower bounds on the number of unit perimeter tri...
research
12/11/2016

A-Discriminants for Complex Exponents, and Counting Real Isotopy Types

We extend the definition of A-discriminant varieties, and Kapranov's par...
research
04/02/2018

On the Reeb spaces of definable maps

We prove that the Reeb space of a proper definable map in an arbitrary o...
research
07/21/2021

On generalizing Descartes' rule of signs to hypersurfaces

We give partial generalizations of the classical Descartes' rule of sign...
research
10/17/2022

A multidimensional Ramsey Theorem

Ramsey theory is a central and active branch of combinatorics. Although ...
research
01/09/2018

The DMT classification of real and quaternionic lattice codes

In this paper we consider space-time codes where the code-words are rest...
research
10/17/2017

On the bit-size of non-radical triangular sets

We present upper bounds on the bit-size of coefficients of non-radical l...

Please sign up or login with your details

Forgot password? Click here to reset