The complexity of the $q$-analog of the $n$-cube

Details The complexity of the $q$-analog of the $n$-cube The complexity of the $q$-analog of the $n$-cube

2011-11-08

arxiv.org/abs/1111.1799v2

Mathematics

Combinatorics

12 pages. This paper is a revised and expanded version of part of the author's previous paper " Counting spanning trees of the

Scientific paper

We present a positive, combinatorial, good formula for the complexity (=
number of spanning trees) of the $q$-analog of the $n$-cube. Our method also
yields the explicit block diagonalization of the commutant of the $GL(n,F_q)$
action on the $q$-analog of the Boolean algebra.

Affiliated with

Also associated with

No associations

Rating

The complexity of the $q$-analog of the $n$-cube does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complexity of the $q$-analog of the $n$-cube, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of the $q$-analog of the $n$-cube will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-52991