Universal convex coverings
نویسنده
چکیده
In every dimension d ≥ 1, we establish the existence of a positive finite constant vd and of a subset Ud of R d such that the following holds: C + Ud = R d for every convex set C ⊂ R of volume at least vd and Ud contains at most log(r) r points at distance at most r from the origin, for every large r.
منابع مشابه
ALGEBRAS WITH CYCLE-FINITE STRONGLY SIMPLY CONNECTED GALOIS COVERINGS
Let $A$ be a nite dimensional $k-$algebra and $R$ be a locally bounded category such that $R rightarrow R/G = A$ is a Galois covering dened by the action of a torsion-free group of automorphisms of $R$. Following [30], we provide criteria on the convex subcategories of a strongly simply connected category R in order to be a cycle- nite category and describe the module category of $A$. We p...
متن کاملOn pseudo-convex decompositions, partitions, and coverings
We introduce pseudo-convex decompositions, partitions, and coverings for planar point sets. They are natural extensions of their convex counterparts and use both convex polygons and pseudo-triangles. We discuss some of their basic combinatorial properties and establish upper and lower bounds on their complexity.
متن کاملNilpotent groups and universal coverings of smooth projective varieties
Characterizing the universal coverings of smooth projective varieties is an old and hard question. Central to the subject is a conjecture of Shafarevich according to which the universal cover X̃ of a smooth projective variety is holomorphically convex, meaning that for every infinite sequence of points without limit points in X̃ there exists a holomorphic function unbounded on this sequence. In t...
متن کاملOn Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کاملDecompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudo-triangles. This pseudo-convex decomposition is significantly sparser than either convex decompositions or pseudo-triangulations for planar point sets and simple polygons. We also introduce pseudo-convex partitions and coverings. We establish some basic properties and give combinatorial bounds on their c...
متن کامل