Permutations and sequences
From MaRDI portal
Cites work
- Enumeration of permutations of \((1, \ldots, n)\) by number of maxima
- Enumeration of sequences by rises and falls: a refinement of the Simon Newcomb problem
- Enumeration of up-down sequences
- Extended Bernoulli and Eulerian numbers
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3433888 (Why is no real title available?)
- scientific article; zbMATH DE number 3233639 (Why is no real title available?)
- On the Generating Function for Permutations with Repetitions and Inversions
- Sequences and inversions
- Sequences with adjacent elements unequal
- Simon Newcomb’s Problem
- Théorie géométrique des polynômes eulériens
- Up-down sequences
- Über die Bernoullischen Zahlen und die Eulerschen Polynome
Cited in
(11)- 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
- The Dumont ansatz for the Eulerian polynomials, peak polynomials and derivative polynomials
- Dynamic space packing
- Subalgebras of Solomon's descent algebra based on alternating runs
This page was built for publication: Permutations and sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844839)
