Polyhedral joins and graph complexes

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Bravo, Andrés Carnero
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908467730579456
author Bravo, Andrés Carnero
author_facet Bravo, Andrés Carnero
contents We give a decomposition of the suspension of a polyhedral join in terms of the polyhedral smash product of the suspension of the family of pairs, and study some cases in which the formula can be desuspended, particularly for polyhedral joins over independence complexes of graphs. We also give some lower bounds for the connectivity of polyhedral joins. We use these results to study the homotopy type of the forest filtration for some lexicographic products of graphs.
format Preprint
id arxiv_https___arxiv_org_abs_2307_14321
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Polyhedral joins and graph complexes
Bravo, Andrés Carnero
Algebraic Topology
Combinatorics
05E45, 55P10, 55P15, 05C76
We give a decomposition of the suspension of a polyhedral join in terms of the polyhedral smash product of the suspension of the family of pairs, and study some cases in which the formula can be desuspended, particularly for polyhedral joins over independence complexes of graphs. We also give some lower bounds for the connectivity of polyhedral joins. We use these results to study the homotopy type of the forest filtration for some lexicographic products of graphs.
title Polyhedral joins and graph complexes
topic Algebraic Topology
Combinatorics
05E45, 55P10, 55P15, 05C76
url https://arxiv.org/abs/2307.14321