期刊
ADVANCES IN APPLIED MATHEMATICS
卷 33, 期 4, 页码 710-727出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.aam.2004.03.003
关键词
trees; forests; partitions; poser; contractibility
We investigate the combinatorics of a topological space that is generated by the set of edge-weighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial order on semilabelled forests. We then describe some combinatorial properties of this poset, showing that, for example, it is pure, thin and contractible. (C) 2004 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据