On inversions and cycles in permutations

DOI10.1016/S0195-6698(87)80031-8zbMATH Open0636.05002OpenAlexW1986976002MaRDI QIDQ1097883FDOQ1097883

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

Recommendations

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

zbMATH Keywords

permutationunimodal cycle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Principles of combinatorics
• Title not available (Why is that?)
• A \(q\)-analog of the exponential formula
• Title not available (Why is that?)

Cited In (11)

• A cycle lemma for permutation inversions
• Extremal problems on permutations under cyclic equivalence
• Permutations with inversions
• Recursive inversion models for permutations
• The number of inversions of permutations with fixed shape
• Counting Dyck paths by area and rank
• 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
• Title not available (Why is that?)
• 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)