Non-Embeddability of Geometric Lattices and Buildings

Popis výsledku

—

Jazyk výsledku
angličtina
Název v původním jazyce
Non-Embeddability of Geometric Lattices and Buildings
Popis výsledku v původním jazyce
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 wellas several classes of finite buildings, all of which are order complexes, are hard to embed. That means that such -dimensional complexes require -dimensional Euclidean space for an embedding. (This dimension is always sufficient for any -complex.) We develop a method to show non-embeddability for general order complexes of posets.
Název v anglickém jazyce
Non-Embeddability of Geometric Lattices and Buildings
Popis výsledku anglicky
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 wellas several classes of finite buildings, all of which are order complexes, are hard to embed. That means that such -dimensional complexes require -dimensional Euclidean space for an embedding. (This dimension is always sufficient for any -complex.) We develop a method to show non-embeddability for general order complexes of posets.

Projekt
GBP202/12/G061: Centrum excelence - Institut teoretické informatiky (CE-ITI)
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění
2014
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Druh výsledku

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

J_x

CEP

BA - Obecná matematika

Rok uplatnění

2014