Non-embeddability of geometric lattices and buildings

DOI10.1007/S00454-014-9591-8zbMATH Open1415.51012arXiv1211.2409OpenAlexW2030204908MaRDI QIDQ741603FDOQ741603

Authors: Martin Tancer, Kathrin Vorwerk 

Publication date: 12 September 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric lattices as well as several classes of finite buildings, all of which are order complexes, are hard to embed. That means that such d-dimensional complexes require (2d + 1)-dimensional Euclidean space for an embedding. (This dimension is in general always sufficient for any d-complex.) We develop a method to show non-embeddability for general order complexes of posets which builds on properties of the van Kampen obstruction.

Full work available at URL: https://arxiv.org/abs/1211.2409

Recommendations

• Geometric complexity of embeddings in \(\mathbb R^d\)
• Some minimal nonembeddable complexes
• scientific article; zbMATH DE number 1500688
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• A note on geometric embeddings of simplicial complexes in a Euclidean space

zbMATH Keywords

simplicial complexembeddingbuildingsfinite projective spacegeometric latticealmost embedding

Mathematics Subject Classification ID

Buildings and the geometry of diagrams (51E24) Other finite nonlinear geometries (51E25)

Cites Work

• A course in combinatorics.
• Buildings of spherical type and finite BN-pairs
• Buildings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• Theory of Matroids
• Title not available (Why is that?)
• Minors in random and expanding hypergraphs
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• On complements in lattices of finite length
• The van Kampen obstruction and its relatives

Cited In (2)

• Action dimension of lattices in Euclidean buildings
• Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes

This page was built for publication: Non-embeddability of geometric lattices and buildings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741603)