On inversions and cycles in permutations

DOI10.1016/S0195-6698(87)80031-8MaRDI QIDQ1097883zbMATH OpenOpenAlexFDO

Authors Paul Edelman

Publication date 1987

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0195-6698(87)80031-8

zbMATH Keywords

permutationunimodal cycle

Mathematics Subject Classification ID

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

Recommendations

• Extremal problems on permutations under cyclic equivalence
• Permutations with inversions
• Characteristic Numbers of Permutations
• Permutation statistics on involutions
• Involutions and their progenies

Cites work

• scientific article; zbMATH DE number 3149991 (Why is no real title available?)
• scientific article; zbMATH DE number 3443655 (Why is no real title available?)
• scientific article; zbMATH DE number 3185005 (Why is no real title available?)
• A q-analog of the exponential formula
• Principles of combinatorics

Cited in

(12)

• A cycle lemma for permutation inversions
• Extremal problems on permutations under cyclic equivalence
• Recursive inversion models for permutations
• Permutations with inversions
• Counting Dyck paths by area and rank
• Permutations with few inversions
• The number of inversions of permutations with fixed shape
• Sum of lengths of inversions in permutations
• Loops with two-sided inverses constructed by a class of regular permutation sets.
• Inversions and Major Index for Permutations
• scientific article; zbMATH DE number 3747124 (Why is no real title available?)
• Token Swapping on Trees

This page was built for publication: On inversions and cycles in permutations

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