Permutations and sequences
From MaRDI portal
Publication:1844839
DOI10.1016/0001-8708(74)90025-5zbMath0285.05011MaRDI QIDQ1844839
Publication date: 1974
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(74)90025-5
05A15: Exact enumeration problems, generating functions
05B15: Orthogonal arrays, Latin squares, Room squares
Related Items
On zigzag permutations and comparisons of adjacent elements, Some stochastic processes in a random permutation, Binomial posets, Möbius inversion, and permutation enumeration, On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations, On the distribution of the number of occurrences of an order-preserving pattern of length three in a random permutation, A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems, A Formal Calculus for the Enumerative System of Sequences-II. Applications, A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extended Bernoulli and Eulerian numbers
- Enumeration of permutations of \((1, \ldots, n)\) by number of maxima
- Sequences and inversions
- Théorie géométrique des polynômes eulériens
- Sequences with adjacent elements unequal
- Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
- Enumeration of up-down sequences
- Up-down sequences
- Simon Newcomb’s Problem
- On the Generating Function for Permutations with Repetitions and Inversions