Binomial posets, Möbius inversion, and permutation enumeration
- 1 May 1976
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 20 (3) , 336-356
- https://doi.org/10.1016/0097-3165(76)90028-5
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Permutations and sequencesAdvances in Mathematics, 1974
- Enumeration of pairs of permutations and sequencesBulletin of the American Mathematical Society, 1974
- Enumeration of rises and falls by positionDiscrete Mathematics, 1973
- Enumeration of up-down sequencesDiscrete Mathematics, 1973
- Permutations with prescribed patternMathematische Nachrichten, 1973
- Supersolvable latticesAlgebra universalis, 1972
- Simon Newcomb’s ProblemSIAM Journal on Applied Mathematics, 1969
- On the foundations of combinatorial theory I. Theory of M bius FunctionsProbability Theory and Related Fields, 1964