Computing generating functions of ordered partitions with the transfer-matrix method - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2006

Computing generating functions of ordered partitions with the transfer-matrix method

Jiang Zeng

Abstract

An ordered partition of $[n]:=\{1,2,\ldots, n\}$ is a sequence of disjoint and nonempty subsets, called blocks, whose union is $[n]$. The aim of this paper is to compute some generating functions of ordered partitions by the transfer-matrix method. In particular, we prove several conjectures of Steingrímsson, which assert that the generating function of some statistics of ordered partitions give rise to a natural $q$-analogue of $k!S(n,k)$, where $S(n,k)$ is the Stirling number of the second kind.
Fichier principal
Vignette du fichier
dmAG0112.pdf (247.68 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184713 , version 1 (17-08-2015)

Identifiers

Cite

Masao Ishikawa, Anisse Kasraoui, Jiang Zeng. Computing generating functions of ordered partitions with the transfer-matrix method. Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, 2006, Nancy, France. pp.193-202, ⟨10.46298/dmtcs.3508⟩. ⟨hal-01184713⟩
115 View
648 Download

Altmetric

Share

Gmail Facebook X LinkedIn More