Related papers: Simplicial arrangements on convex cones

Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…

We construct a group K_n with properties similar to infinite Coxeter groups. In particular, it has a geometric representation featuring hyperplanes and simplicial chambers. The generators of K_n are given by 2-element subsets of {0, .., n}.…

We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…

Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…

We translate the axioms of a Weyl groupoid with (not necessarily finite) root system in terms of arrangements. The result is a correspondence between Weyl groupoids permitting a root system and Tits arrangements satisfying an integrality…

We show that a locally symmetric space of noncompact type and with finite volume is quasi-isometric to the euclidean cone over a finite simplicial complex. A detailed analysis of metric properties yields a proof of a conjecture of Siegel.

We investigate the faces and the face lattices of arbitrary Coxeter group invariant convex subcones of the Tits cone of a linear Coxeter system as introduced by E. B. Vinberg. Particular examples are given by certain Weyl group invariant…

We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…

In this paper we introduce the galaxy of Coxeter groups -- an infinite dimensional, locally finite, ranked simplicial complex which captures isomorphisms between Coxeter systems. In doing so, we would like to suggest a new framework to…

A weak pseudoline arrangement is a topological generalization of a line arrangement, consisting of curves topologically equivalent to lines that cross each other at most once. We consider arrangements that are outerplanar---each crossing is…

The notion of a linear Coxeter system introduced by Vinberg generalizes the geometric representation of a Coxeter group. Our main theorem asserts that if $v$ is an element of the Tits cone of a linear Coxeter system and $\cW$ is the…

We introduce some compact orbifolds on which there is a certain finite group action having a simple convex polytope as the orbit space. We compute the orbifold fundamental group and homology groups of these orbifolds. We calculate the…

Problems related to projections on closed convex cones are frequently encountered in optimization theory and related fields. To study these problems, various unifying ideas have been introduced, including asymmetric vector-valued norms and…

We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new…

In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of…

This paper presents a selected tour through the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set. Many convex sets have lifts that are…

First, we shall formulate and prove Theorem of Lie-Kolchin type for a cone and derive some algebro-geometric consequences. Next, inspired by a recent result of Dinh and Sibony we pose a conjecture of Tits type for a group of automorphisms…

The simplest way to generate a lattice of convex sets is to consider an initial set of points and draw segments, triangles, and any convex hull from it, then intersect them to obtain new points, and so forth. The result is an infinite…

Let W be an irreducible finitely generated Coxeter group. The geometric representation of W in GL(V) provides a discrete embedding in the orthogonal group of the Tits form (the associated bilinear form of the Coxeter group). If the Tits…

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…