2 citations · 6 across the 5 of their papers we have counts for
4 papers · 1 filter
Non-embeddability of geometric lattices and buildings
Martin Tancer, Kathrin Vorwerk
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…
On the connectivity of manifold graphs
Anders Björner, Kathrin Vorwerk
This paper is concerned with lower bounds for the connectivity of graphs (one-dimensional skeleta) of triangulations of compact manifolds. We introduce a structural invariant b_M f…
Connectivity of chamber graphs of buildings and related complexes
Anders Björner, Kathrin Vorwerk
Let Δbe a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(Δ), whose edges are the pairs of adjacent chambers in Δ, is known…
Pattern avoidance and the Bruhat order on involutions
Axel Hultman, Kathrin Vorwerk
We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45…