Binomial posets, Möbius inversion, and permutation enumeration
type: Item
instance of: scholarly article
title: Binomial posets, Möbius inversion, and permutation enumeration
zbMATH Open document ID: 0331.05004
DOI: 10.1016/0097-3165(76)90028-5
author: Richard P. Stanley
published in: Journal of Combinatorial Theory. Series A
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 11M06
Mathematics Subject Classification ID: 05A19
Mathematics Subject Classification ID: 11A25
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 3517157
MaRDI profile type: Publication
full work available at URL: 0097-3165(76)90028-5
OpenAlex ID: W1996959888
cites work: Q5603208
cites work: q-Bernoulli and Eulerian Numbers
cites work: Permutations with prescribed pattern
cites work: Enumeration of up-down sequences
cites work: Addendum to: Enumeration of up-down sequences
cites work: Permutations and sequences
cites work: Enumeration of pairs of permutations and sequences
cites work: Q4769056
cites work: Simon Newcomb’s Problem
cites work: Q5685088
cites work: Théorie géométrique des polynômes eulériens
cites work: Q3259107
cites work: Q5549086
cites work: Q3243274
cites work: On the foundations of combinatorial theory I. Theory of M�bius Functions
cites work: Ordered structures and partitions
cites work: Supersolvable lattices
description: scientific article; zbMATH DE number 3517157