vix.ing · top · new · best · stats · spec

Subdivision of complexes of k-Trees

2005/09/16 by Emanuele Delucchi, Delucchi, Emanuele · 1 citation
Computer Science · Mathematics · #Commutative Algebra and Its Applications #Graph theory and applications #Topological and Geometric Data Analysis #math.CO #msc:05E25 #msc:57Q05

paper · pdf · doi:10.48550/arxiv.math/0509378

9 pages, 1 figure

arxiv created 2005/09/16 · arxiv updated 2009/12/01

Abstract

Consider the poset of partitions of 1,...(n-1)k+1 with block sizes congruent to 1 modulo k. We prove that its order complex is a subdivision of the complex of k-trees, thereby answering a question posed by Feichtner. The result is obtained by an ad-hoc generalization of concepts from the theory of nested set complexes to non-lattices.

Cited by

Related