We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of these results, we establish several generalizations of the celebrated Bang plank covering theorem. We prove a tight polynomial analog of the Bang theorem for the Euclidean ball and an even stronger polynomial version for the complex projective space. Specifically, for the ball, we show that for every real nonzero d-variate polynomial P of degree n, there exists a point in the unit d-dimensional ball at distance at least 1/n from the zero set of the polynomial P. Using the polynomial approach, we also p...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
This paper examines the complexity of several geometric problems due to unbounded dimension. The pro...
Let X be any subset of the interval [−1, 1]. A subset I of the unit sphere in Rn will be called X-av...
We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zh...
We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zh...
We prove the complex polynomial plank covering theorem for not necessarily homogeneous polynomials. ...
We prove the complex polynomial plank covering theorem for not necessarily homogeneous polynomials. ...
AbstractIn this paper we prove simple estimates relating the value of a complex homogeneous polynomi...
An ordinary hypersphere of a set of points in real d-space, where no d + 1 points lie on a (d - 2)-s...
An ordinary hypersphere of a set of points in real d-space, where no d + 1 points lie on a (d - 2)-s...
An ordinary hypersphere of a set of points in real d-space, where no d + 1 points lie on a (d - 2)-s...
We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$...
This thesis explores several problems in discrete geometry, focusing on covering problems. We first ...
The Point Hyperplane Cover problem in $R d$ takes as input a set of $n$ points in $R d$ and a positi...
How far can an arbitrary point of the unit sphere Ωd of Rd be away from a finite set of points X of ...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
This paper examines the complexity of several geometric problems due to unbounded dimension. The pro...
Let X be any subset of the interval [−1, 1]. A subset I of the unit sphere in Rn will be called X-av...
We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zh...
We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zh...
We prove the complex polynomial plank covering theorem for not necessarily homogeneous polynomials. ...
We prove the complex polynomial plank covering theorem for not necessarily homogeneous polynomials. ...
AbstractIn this paper we prove simple estimates relating the value of a complex homogeneous polynomi...
An ordinary hypersphere of a set of points in real d-space, where no d + 1 points lie on a (d - 2)-s...
An ordinary hypersphere of a set of points in real d-space, where no d + 1 points lie on a (d - 2)-s...
An ordinary hypersphere of a set of points in real d-space, where no d + 1 points lie on a (d - 2)-s...
We use linear programming techniques to find points of absolute minimum over the unit sphere $S^{d}$...
This thesis explores several problems in discrete geometry, focusing on covering problems. We first ...
The Point Hyperplane Cover problem in $R d$ takes as input a set of $n$ points in $R d$ and a positi...
How far can an arbitrary point of the unit sphere Ωd of Rd be away from a finite set of points X of ...
The kissing number problem asks for the maximal number of non-overlapping unit balls in R^n that tou...
This paper examines the complexity of several geometric problems due to unbounded dimension. The pro...
Let X be any subset of the interval [−1, 1]. A subset I of the unit sphere in Rn will be called X-av...