Number of permutations with prescribed up-down structure as a function of two variables

DOI10.1515/INTEGERS-2011-0122MaRDI QIDQ2911026zbMATH OpenOpenAlexFDO

Authors Vladimir Shevelev

Publication date 12 September 2012

Published in Integers (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/INTEGERS/papers/m1/m1.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

alternating permutationsEulerian numbersNiven's signature for permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Congruences; primitive roots; residue systems (11A07) Bernoulli and Euler numbers and polynomials (11B68) Special sequences and polynomials (11B83)

Recommendations

• On arithmetic and asymptotic properties of up-down numbers
• Some polynomials associated with up-down permutations
• Counting permutations by their alternating runs
• Cycle-up-down permutations
• Loopless generation of up-down permutations

Cited in

(5)

• Refined Eulerian numbers and ballot permutations
• Ballot permutations and odd order permutations
• Using the Entringer numbers to count the alternating permutations according a new parameter
• Quasispecies on class-dependent fitness landscapes
• Up-down coefficients for permutations

This page was built for publication: Number of permutations with prescribed up-down structure as a function of two variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911026)