Related papers: Convex Polygons are Self-Coverable
Families of translates and homothets of strictly convex curves are proven to possess Helly-type properties generalizing those of a circle. Weaker results are shown for arbitrary convex curves.
We present a family of complete acyclic Morse matchings on the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. In a future paper we will utilize these…
To every affine real arrangement of hyperplanes we associate a family of diagrams of spaces over the face poset of the arrangement. We show that any cover of the complement of the complexification of the arrangement is homotopy equivalent…
We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…
The colourful simplicial depth conjecture states that any point in the convex hull of each of d+1 sets, or colours, of d+1 points in general position in R^d is contained in at least d^2+1 simplices with one vertex from each set. We verify…
We study groups of homeomorphic bijections on spaces that are finite unions of compact connected linearly ordered subsets. We prove that all such groups when endowed with the topology of point-wise convergence are topological groups. }
Equifacetal simplices, all of whose codimension one faces are congruent to one another, are studied. It is shown that the isometry group of such a simplex acts transitively on its set of vertices, and, as an application, equifacetal…
We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…
We classify the convex polytopes whose symmetry groups have two orbits on the flags. These exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the…
The notion of composite system made up of distinguishable parties is investigated in the context of arbitrary convex spaces.
We establish two versions of a central theorem, the Family Colimit Theorem, for the coarse coherence property of metric spaces. This is a coarse geometric property and so is well-defined for finitely generated groups with word metrics. It…
The present paper is concerned with Lipschitz properties of convex mappings. One considers the general context of mappings defined on an open convex subset $\Omega$ of a locally convex space $X$ and taking values in a locally convex space…
We establish a family of parametric isoperimetric-type inequalities with multiple geometric quantities for closed convex curves. These inequalities hold under certain parameter conditions. We also prove the equality conditions. Some new…
Does a given a set of polyominoes tile some rectangle? We show that this problem is undecidable. In a different direction, we also consider tiling a cofinite subset of the plane. The tileability is undecidable for many variants of this…
In this paper we try to generalize the Haefliger theorem on completly solvable Lie foliations. We prove that: every completely solvable Lie foliation on a compact manifold is the inverse image of a homogenus foliation. Every manifold in…
A centrally symmetric convex body is a convex compact set with non-empty interior that is symmetric about the origin. Of particular interest are those that are both smooth and strictly convex -- known here as regular symmetric bodies --…
In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…
Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…
We prove a 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…