We prove the complex polynomial plank covering theorem for not necessarily homogeneous polynomials. As the consequence of this result, we extend the complex plank theorem of Ball to the case of planks that are not necessarily centrally symmetric and not necessarily round. We also prove a weaker version of the spherical polynomial plank covering conjecture for planks of different widths
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
AbstractA well-known theorem of Alexander [1] says that every orientable surface is a branched cover...
We prove the complex polynomial plank covering theorem for not necessarily homogeneous polynomials. ...
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 note that the recent polynomial proofs of the spherical and complex plank covering problems by Zh...
We study lower bounds for the norm of the product of polynomials and their applications to the so ca...
This thesis explores several problems in discrete geometry, focusing on covering problems. We first ...
A slab (or plank) is the part of the d-dimensional Euclidean space that lies between two parallel hy...
In the 1930's, Tarski introduced his plank problem at a time when the eld Discrete Geometry was...
AbstractHeron’s formula for a triangle gives a polynomial for the square of its area in terms of the...
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
In 1932 A. Tarski conjectured that if a convex body in R^N is covered by a finite collection of plan...
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
AbstractA well-known theorem of Alexander [1] says that every orientable surface is a branched cover...
We prove the complex polynomial plank covering theorem for not necessarily homogeneous polynomials. ...
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 note that the recent polynomial proofs of the spherical and complex plank covering problems by Zh...
We study lower bounds for the norm of the product of polynomials and their applications to the so ca...
This thesis explores several problems in discrete geometry, focusing on covering problems. We first ...
A slab (or plank) is the part of the d-dimensional Euclidean space that lies between two parallel hy...
In the 1930's, Tarski introduced his plank problem at a time when the eld Discrete Geometry was...
AbstractHeron’s formula for a triangle gives a polynomial for the square of its area in terms of the...
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
In 1932 A. Tarski conjectured that if a convex body in R^N is covered by a finite collection of plan...
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane coverin...
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the gr...
AbstractA well-known theorem of Alexander [1] says that every orientable surface is a branched cover...