$q$-模拟$n$-维超立方体的复杂度
组合数学
2011-11-15 v2
摘要
我们给出了-模拟-维超立方体复杂度（即生成树的数量）的一个正的、组合的优良公式。我们的方法还导出了作用在布尔代数的-模拟上的交换子的显式块对角化。
引用
@article{arxiv.1111.1799,
title = {The complexity of the $q$-analog of the $n$-cube},
author = {Murali K. Srinivasan},
journal= {arXiv preprint arXiv:1111.1799},
year = {2011}
}
备注
12 pages. This paper is a revised and expanded version of part of the author's previous paper " Counting spanning trees of the hypercube and its $q$-analogs by explicit block diagonalization" (arXiv:1104.1481), to which a reference has been added