Related papers: On universal covers for four-dimensional sets of a…

According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…

By Hartman--Nirenberg's theorem, any complete flat hypersurface in Euclidean space must be a cylinder over a plane curve. However, if we admit some singularities, there are many non-trivial examples. Flat fronts are flat hypersurfaces with…

For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…

We prove that every complete non-compact manifold of finite volume contains a (possibly non-compact) minimal hypersurface of finite volume. The main tool is the following result of independent interest: if a region $U$ can be swept out by a…

We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…

A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}. The problem of splitting multiple coverings into several coverings…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

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…

We show that any compact smooth real $n$-dimensional manifold $M$ with $n\leq 11$ can be smoothly embedded into $\mathbb{C}^{n+1}$ as a polynomially convex set. In general, there is no such embedding into $\mathbb{C}^n$. This solves a…

Let a $R$-body be a closed set, complement of union of open balls of radius $R$ in the Euclidean space. Properties generalizing similar ones for convex sets are proved for the family of $R$-bodies; properties for the family of sets…

We study the problem of covering R^d by overlapping translates of a convex body P, such that almost every point of R^d is covered exactly k times. Such a covering of Euclidean space by translations is called a k-tiling. The investigation of…

We define the compact universal cover of a compact, metrizable connected space (i.e. a continuum) X to be the inverse limit of all continua that regularly cover X. We show that such covers do indeed form an inverse system with bonding maps…

If every vertex in a map has one out of two face-cycle types, then the map is said to be $2$-semiequivelar. A 2-uniform tiling is an edge-to-edge tiling of regular polygons having $2$ distinct transitivity classes of vertices. Clearly, a…

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 Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…

Let $X$ be a general complex projective hypersurface in $\mathbb{P}^{n+1}$ of degree $d>1$. A point $P$ not in $X$ is called uniform if the monodromy group of the projection of $X$ from $P$ is isomorphic to the symmetric group. We prove…

Let A be a basic connected finite dimensional algebra over an algebraically closed field k. Assuming that A is monomial and that the ordinary quiver Q of A has no oriented cycle and no multiple arrows, we prove that A admits a universal…

We show that there is no compact hyperbolic Coxeter d-polytope with d+4 facets for d>7. This bound is sharp: examples of such polytopes up to dimension 7 were found by Bugaenko (1984). We also show that in dimension d=7 the polytope with 11…

In an $n$-dimensional normed space every bounded set has a unique circumball if and only if every set of cardinality two has a unique circumball and if and only if the unit ball of the space is strictly convex. When the symmetry of the norm…