Emanuele Delucchi
Published 2005-09-16Version 1
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.
Comments: 9 pages, 1 figure
Complexes of trees and nested set complexes
Nested set complexes of Dowling lattices and complexes of Dowling trees
The Discrete Fundamental Group of the Order Complex of $B_n$
![QR code for arXiv:math/0509378 [math.CO]](http://oss.arxitics.com/images/favicon.svg)