Subdivision of complexes of k-Trees

Simple item page
dc.creatorDelucchi, Emanuele
dc.date2005-09-16
dc.date.accessioned2026-07-07T05:23:16Z
dc.date.available2026-07-07T05:23:16Z
dc.descriptionConsider 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.
dc.description9 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0509378
dc.identifierhttp://arxiv.org/abs/math/0509378
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76368
dc.subjectCombinatorics
dc.subject05E25; 57Q05
dc.titleSubdivision of complexes of k-Trees
dc.typetext

Files

Collections

arXiv