arXiv:1603.07619 [math.CO]AbstractReferencesReviewsResources
The number of direct-sum decompositions of a finite vector space
Published 2016-03-23Version 1
The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a finite vector space is the vector space analogue of a set partition. This paper develops the formulas for the number of direct-sum decompositions that are the q-analogs of the formulas for: (1) the number of set partitions with a given number partition signature; (2) the number of set partitions of an n-element set with m blocks (the Stirling numbers of the second kind); and (3) for the total number of set partitions of an n-element set (the Bell numbers).
Related articles: Most relevant | Search more
arXiv:math/0604292 [math.CO] (Published 2006-04-12)
Pattern Avoidance in Set Partitions
arXiv:2401.01687 [math.CO] (Published 2024-01-03)
Counting symmetric and non-symmetric peaks in a set partition
arXiv:1201.5994 [math.CO] (Published 2012-01-28)
On sets of vectors of a finite vector space in which every subset of basis size is a basis II