On the construction of Eulerian permutations

DOI10.1080/02522667.1997.10699314MaRDI QIDQ4354092zbMATH OpenOpenAlexFDO

Authors E. Foundas, Michael A. Georgiacodis

Publication date 1997

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1997.10699314

zbMATH Keywords

algorithmic constructionpermutationsrise

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Recommendations

• Euler Numbers and Skew-Hooks
• Asymptotic normality of the generalized Eulerian numbers
• scientific article; zbMATH DE number 3941545

Cites work

• Characteristic Numbers of Permutations
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• Permutations and sequences with repetitions by number of increases
• Some considerations on permutation trees

Cited in

(5)

• A permutations representation that knows what ``Eulerian means
• scientific article; zbMATH DE number 5115923 (Why is no real title available?)
• A Construction of a perfect set of Euler tours of K2k+1
• scientific article; zbMATH DE number 5260283 (Why is no real title available?)
• On an extension of Euler numbers and records of alternating permutations

This page was built for publication: On the construction of Eulerian permutations

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