相关论文: Convex rank 1 subsets of Euclidean buildings (of t…

Given a finite point set $X$ in the plane, the degree of a pair $\{x,y\} \subset X$ is the number of empty triangles $t=conv\{x,y,z\}$, where empty means $t\cap X=\{x,y,z\}$. Define $deg X$ as the maximal degree of a pair in $X$. Our main…

We construct new examples of immersed minimal surfaces with catenoid ends and finite total curvature, of both genus zero and higher genus. In the genus zero case, we classify all such surfaces with at most $2n+1$ ends, and with symmetry…

Suppose that $A$ and $B$ are closed subsets of a Euclidean space such that $A\cap B\neq\varnothing$, and we aim to find a point in this intersection with the help of the sequences $(a_n)_\nnn$ and $(b_n)_\nnn$ generated by the \emph{method…

A set $A$ in a finite dimensional Euclidean space is \emph{monovex} if for every two points $x,y \in A$ there is a continuous path within the set that connects $x$ and $y$ and is monotone (nonincreasing or nondecreasing) in each coordinate.…

We give a new proof of a theorem of Kleiner-Leeb: that any quasi-isometrically embedded Euclidean space in a product of symmetric spaces and Euclidean buildings is contained in a metric neighborhood of finitely many flats, as long as the…

We study a class of continuous deformations of branched complex projective structures on closed surfaces of genus $g\geq 2$, which preserve the holonomy representation of the structure and the order of the branch points. In the case of…

We introduce the notion of ideal triangle in the Bruhat-Tits building associated to a split group -- it is analogous to the usual notion of triangle, but one vertex is "at infinity" in a certain direction. We prove that the algebraic…

We introduce a construction turning some Coxeter and Davis realizations of buildings into systolic complexes. Consequently groups acting geometrically on buildings of triangle types distinct from $(2,4,4)$, $(2,4,5)$, $(2,5,5)$, and various…

We classify thick irreducible 3-spherical twin buildings of rank at least 3 in which every panel contains at least 6 chambers. Together with the Main result of [11] we obtain a classification of thick irreducible 3-spherical twin buildings.

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Motivated by the path integral analysis of boundary conditions in a 3-dimensional topological sigma-model, we suggest a definition of the 2-category associated with a holomorphic symplectic manifold X and study its properties. The simplest…

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 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…

We prove that if an $n$-dimensional space $X$ satisfies certain topological conditions then any triangulation of $X$ as well as any its representation as a simplicial set with contractible faces has at least $2^n$ faces of dimension $n$.…

Completely reducible subcomplexes of spherical buildings was defined by J.P. Serre and are used in studying subgroups of reductive algebraic groups. We begin the study of completely reducible subcomplexes of twin buildings and how they may…

The $X$-rank of a point $p$ in projective space is the minimal number of points of an algebraic variety $X$ whose linear span contains $p$. This notion is naturally submultiplicative under tensor product. We study geometric conditions that…

We show that the group of type-preserving automorphisms of any irreducible semi-regular thick right-angled building is abstractly simple. When the building is locally finite, this gives a large family of compactly generated (abstractly)…

Every ordered collection of sets in Euclidean space can be associated to a combinatorial code, which records the regions cut out by the sets in space. Given two ordered collections of sets, one can form a third collection in which the…

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…