Related papers: Extensions of polynomial plank covering theorems

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…

A plank is the part of space between two parallel planes. The following open problem, posed 45 years ago, can be viwed as the converse of Tarski's plank problem (Bang's theorem): Is it true that if the total width of a collection of planks…

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…

Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…

We present a streamlined proof of K. Ball's symmetric plank theorem in $\mathbb{R}^d$, which solves the affine plank problem raised by Th. Bang for symmetric convex bodies.

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…

We prove a common extension of Bang's and Kadets' lemmas for contact pairs, in the spirit of the Colourful Carath\'eodory Theorem. We also formulate a generalized version of the affine plank problem and prove it under special assumptions.…

Ball's complex plank theorem states that if $v_1,\dots,v_n$ are unit vectors in $\mathbb{C}^d$, and $t_1,\dots,t_n$, non-negative numbers satisfying $\sum_{k=1}^nt_k^2 = 1,$ then there exists a unit vector $v$ in $\mathbb{C}^d$ for which…

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

If a convex body $K \subset \mathbb{R}^n$ is covered by the union of convex bodies $C_1, \ldots, C_N$, multiple subadditivity questions can be asked. Two classical results regard the subadditivity of the width (the smallest distance between…

In this survey, different aspects of the theory of orthogonal polynomials of one (real or complex) variable are reviewed. Orthogonal polynomials on the unit circle are not discussed.

We develop an explicit covering theory for complexes of groups, parallel to that developed for graphs of groups by Bass. Given a covering of developable complexes of groups, we construct the induced monomorphism of fundamental groups and…

The purpose of this work is to analyse a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which includes an additional term on the sphere. First, we will get connection formulas relating classical…

We establish and fully characterize the multidimensional extension of the Stronger Central Sets Theorem. Additionally, we develop a polynomial generalization of this result. Our approach utilizes tools from the Algebra of the Stone-\v{C}ech…

In this note we give the answer to the question posed by V. N. Dubinin concerning covering properties of complex polynomials

Using the theory of analytic functions of several complex variables, we prove that if an analytic function in several variables satisfies a system of $q$-partial differential equations, then, it can be expanded in terms of the product of…

We investigate the homogeneity of certain kind of slices of the complete complexification of a proper complex equifocal submanifold in a symmetric space of non-compact type.

In this paper we prove the Gromov--Milman conjecture (the Dvoretzky type theorem) for homogeneous polynomials on $\mathbb R^n$, and improve bounds on the number $n(d,k)$ in the analogous conjecture for odd degrees $d$ (this case is known as…

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…