Related papers: Intersections of Apartments

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if…

We define a new structure on a space endowed with convexities, and call it a fractoconvex structure (or, a space with fractoconvexity). We introduce two operations on a set of fractoconvexities and in a special case we show that they…

Let $W$ be a Coxeter group and $r\in W$ a reflection. If the group of order 2 generated by $r$ is the intersection of all the maximal finite subgroups of $W$ that contain it, then any isomorphism from $W$ to a Coxeter group $W'$ must take…

We study convex subsets of buildings, discuss some structural features and derive several characterizations of buildings.

Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…

Multiplex networks are representations of multilayer interconnected complex networks where the nodes are the same at every layer. They turn out to be good abstractions of the intricate connectivity of multimodal transportation networks,…

We present an obstruction theoretic inductive construction of intersection space pairs, which generalizes Banagl's construction of intersection spaces for arbitrary depth stratifications. We construct intersection space pairs for…

In this paper we show that every sufficiently large family of convex bodies in the plane has a large subfamily in convex position provided that the number of common tangents of each pair of bodies is bounded and every subfamily of size five…

We show that the Kneser graph of objects of a fixed type in a building of spherical type has the unique coclique extension property when the corresponding representation has minuscule weight and also when the diagram is simply laced and the…

For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…

We prove that, apart from some well-known low-dimensional examples, any compact hyperbolic Coxeter polytope has a pair of disjoint facets. This is one of very few known general results concerning combinatorics of compact hyperbolic Coxeter…

We prove that for any partition of a set which contains an infinite arithmetic (respectively geometric) progression into two disjoint subsets, at least one of these subsets contains an infinite number of triplets such that each triplet is…

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

A convex cone is said to be projectionally exposed (p-exposed) if every face arises as a projection of the original cone. It is known that, in dimension at most four, the intersection of two p-exposed cones is again p-exposed. In this paper…

We show that every automorphism of a thick twin building interchanging the halves of the building maps some residue to an opposite one. Furthermore we show that no automorphism of a locally finite 2-spherical twin building of rank at least…

Let $P$ be a set of $n$ points on the plane in general position. We say that a set $\Gamma$ of convex polygons with vertices in $P$ is a convex decomposition of $P$ if: Union of all elements in $\Gamma$ is the convex hull of $P,$ every…

We present a framework to obtain valid inequalities for a reverse convex set: the set of points in a polyhedron that lie outside a given open convex set. Reverse convex sets arise in many models, including bilevel optimization and…

A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…

We prove that given a finite collection of cylinders in $\R^3$ with the property that any two them intersect, then there is a line intersecting an $\alpha$ fraction of the cylinders where $\alpha=\frac 1{28}$. This is a special case of an…

The aim of this work is to prove that the connected parts of Farey complex structure in plane are triangles or quadrangles. To do this work we go back to plane convex polygones with oriented edge for wich we prove that if two consecutive…