pith. sign in

arxiv: math/0509378 · v1 · submitted 2005-09-16 · 🧮 math.CO

Subdivision of complexes of k-Trees

classification 🧮 math.CO
keywords complexcomplexesk-treessubdivisionad-hocansweringblockconcepts
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.