English
Related papers

Related papers: Intersections of Apartments

200 papers

We prove that any convex flat subset in a complete Euclidean building is contained in an apartment of the maximal system of apartments.

Metric Geometry · Mathematics 2026-03-24 Raphael Appenzeller , Auguste Hébert , Alexander Lytchak

In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…

Metric Geometry · Mathematics 2014-08-14 Carlos Ramos-Cuevas

We prove that two dimensional convex subsets of spherical buildings are either buildings or have a center.

Metric Geometry · Mathematics 2007-05-23 Andreas Balser , Alexander Lytchak

A building is a simplicial complex with a covering by Coxeter complexes (called apartments) satisfying certain combinatorial conditions. A building whose apartments are spherical (respectively Euclidean) Coxeter complexes has a natural…

Metric Geometry · Mathematics 2014-11-11 Ruth Charney , Alexander Lytchak

We generalize a result of Serre's to show that if every vertex of some fixed type of a convex subcomplex of an irreducible spherical building has an opposite, then the subcomplex is completely reducible.

Group Theory · Mathematics 2011-02-10 Chris Parker , Katrin Tent

The set of chambers of a real hyperplane arrangement may be ordered by separation from some fixed chamber. When this poset is a lattice, Bjorner, Edelman, and Ziegler proved that the chambers are in natural bijection with the biconvex sets…

Combinatorics · Mathematics 2014-11-06 Thomas McConville

We study intersections of projective convex sets in the sense of Steinitz. In a projective space, an intersection of a nonempty family of convex sets splits into multiple connected components each of which is a convex set. Hence, such an…

Metric Geometry · Mathematics 2010-05-12 Takahisa Toda

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…

Metric Geometry · Mathematics 2017-12-05 A. J. Kanel-Belov , A. V. Dyskin , Y. Estrin , E. Pasternak , I. A. Ivanov-Pogodaev

Counting interior-disjoint empty convex polygons in a point set is a typical Erd\H{o}s-Szekeres-type problem. We study this problem for 4-gons. Let $P$ be a set of $n$ points in the plane and in general position. A subset $Q$ of $P$, with…

Computational Geometry · Computer Science 2018-07-27 Ahmad Biniaz , Anil Maheshwari , Michiel Smid

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…

Metric Geometry · Mathematics 2015-06-23 Michael Gene Dobbins , Andreas Holmsen , Alfredo Hubard

It is well known that if there exists a finite set of convex bodies on the plane with non-overlapping interiors, then there is at least one "extremal" one among them, i.e., some one which can be continuously "taken away to the infinity"…

Metric Geometry · Mathematics 2022-01-03 Vassily O. Manturov , Alexei Kanel-Belov , Seongjeong Kim

We give a proof to the following theorem, which is well-known among experts: A connected subcomplex $W$ of a finite dimensional CAT(0) cubed complex $X$ is convex if and only if Lk$(v, W)$ is a full subcomplex of Lk$(v, X)$ for every vertex…

Geometric Topology · Mathematics 2023-03-21 Shunsuke Sakai , Makoto Sakuma

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

Combinatorics · Mathematics 2013-11-27 Pavel Kozhevnikov

It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…

Combinatorics · Mathematics 2023-07-25 Jozsef Solymosi

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…

Metric Geometry · Mathematics 2007-05-23 Andreas Balser

We prove that every pointed closed convex set in $\mathbb{R}^n$ is the intersection of all the rational closed halfspaces that contain it. This generalizes a previous result by the authors for compact convex sets.

Optimization and Control · Mathematics 2018-02-12 Marcel K. de Carli Silva , Levent Tunçel

We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…

Optimization and Control · Mathematics 2016-08-12 D. Drusvyatskiy , A. D. Ioffe , A. S. Lewis

Let F be a finite set of circles in the plane. We point out that the usual convex closure restricted to F yields a convex geometry, that is, a combinatorial structure introduced by P. H Edelman in 1980 under the name "anti-exchange closure…

Rings and Algebras · Mathematics 2013-05-22 Gábor Czédli

In this note, we show that the asymptotic dimension of any building is finite and equal to the asymptotic dimension of an apartment in that building.

Metric Geometry · Mathematics 2018-11-28 Jan Dymara , Thomas Schick

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

Discrete Mathematics · Computer Science 2013-08-29 Alexander Grigoriev , Athanassios Koutsonas , Dimitrios M. Thilikos
‹ Prev 1 2 3 10 Next ›