Related papers: The Complex Illumination Problem

The illumination conjecture asserts that any convex body in $n$-dimensional Euclidean space can be illuminated by at most $2^n$ external light sources or parallel beams of light. Despite recent progress on the illumination conjecture, it…

In ["Illumination of convex bodies with many symmetries", Mathematika 63 (2017)], Tikhomirov verified the Hadwiger-Boltyanski Illumination Conjecture for the class of 1-symmetric convex bodies of sufficiently large dimension. We propose an…

We settle the Hadwiger-Boltyanski Illumination Conjecture for all 1-unconditional convex bodies in ${\mathbb R}^3$ and in ${\mathbb R}^4$. Moreover, we settle the conjecture for those higher-dimensional 1-unconditional convex bodies which…

Covering numbers of convex bodies based on homothetical copies and related illumination numbers are well-known in combinatorial geometry and, for example, related to Hadwiger's famous covering problem. Similar numbers can be defined by…

Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…

We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a strong duality relation between weighted covering and separation numbers and prove a few relations between the…

The Illumination Problem may be phrased as the problem of covering a convex body in Euclidean $n$-space by a minimum number of translates of its interior. By a probabilistic argument, we show that, arbitrarily close to the Euclidean ball,…

In this note we introduce the problem of illumination of convex bodies in spherical spaces and solve it for a large subfamily of convex bodies. We derive from it a combinatorial version of the classical illumination problem for convex…

Let $n\geq C$ for a large universal constant $C>0$, and let $B$ be a convex body in $R^n$ such that for any $(x_1,x_2,\dots,x_n)\in B$, any choice of signs $\varepsilon_1,\varepsilon_2,\dots,\varepsilon_n\in\{-1,1\}$ and for any permutation…

It was conjectured by Levi, Hadwiger, Gohberg and Markus that the boundary of any convex body in ${\mathbb R}^n$ can be illuminated by at most $2^n$ light sources, and, moreover, $2^n-1$ light sources suffice unless the body is a…

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

At a first glance, the problem of illuminating the boundary of a convex body by external light sources and the problem of covering a convex body by its smaller positive homothetic copies appear to be quite different. They are in fact two…

K. Bezdek and Gy. Kiss showed that existence of origin-symmetric coverings of unit sphere in $\mathbb{E}^n$ by at most $2^n$ congruent spherical caps with radius not exceeding $\arccos\sqrt{\frac{n-1}{2n}}$ implies the $X$-ray conjecture…

Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

Let $K$ be a convex body in $\Bbb R^{d}$ and $K_{t}$ its floating bodies. There is a polytope with at most $n$ vertices that satisfies $$ K_{t} \subset P_{n} \subset K $$ where $$ n \leq e^{16d} \frac{vol_{d}(K \setminus K_{t})}{t\…

In this paper we study identities and images of polynomials on null-filiform Leibniz algebras. If $L_n$ is an $n$-dimensional null-filiform Leibniz algebra, we exhibit a finite minimal basis for $\mbox{Id}(L_n)$, the polynomial identities…

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…

With an explicit, algebraic indexing $(2,1)$-category, we develop an efficient homotopy theory of cyclonic objects: circle-equivariant objects relative to the family of finite subgroups. We construct an $\infty$-category of cyclotomic…

In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. Since then, this problem and its analogues have been studied by many authors, including $\mathrm{B\acute{a}r\acute{a}ny}$, Lagarias, Pach,…