Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
type: Item
instance of: scholarly article
title: Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
zbMATH Open document ID: 0482.05012
DOI: 10.1016/0001-8708(82)90032-9
author: Stephen C. Milne
published in: Advances in Mathematics
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A17
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 3756486
zbMATH Keywords: partition lattice
zbMATH Keywords: generating functions
MaRDI profile type: Publication
full work available at URL: 0001-8708(82)90032-9
OpenAlex ID: W1985965909
cites work: On a problem of Rota
cites work: On the Location of the Maximum Stirling Number(s) of the Second Kind
cites work: Application of the Berry-Esseen inequality to combinatorial estimates
cites work: On the “maj” and “inv”q-analogues of Euierian polynomials
cites work: The q-Stirling numbers of first and second kinds
cites work: Partioning algorithms for finite sets
cites work: Restricted growth functions and incidence relations of the lattice of partitions of an n-set
cites work: A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials
cites work: On Rota's problem concerning partitions
cites work: The r-major index
cites work: The (qr)-Simon Newcomb problem
cites work: Q3243274
cites work: The Number of Partitions of a Set
cites work: On the Foundations of Combinatorial Theory IV Finite Vector Spaces and Eulerian Generating Functions
cites work: Q5642570
cites work: Ranking Algorithms for Lists of Partitions
description: scientific article; zbMATH DE number 3756486