On inversions and cycles in permutations (Q1097883): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Principles of combinatorics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4769056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3267408 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5721212 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A \(q\)-analog of the exponential formula / rank | |||
Normal rank | |||
Revision as of 14:45, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On inversions and cycles in permutations |
scientific article |
Statements
On inversions and cycles in permutations (English)
0 references
1987
0 references
Let i(\(\sigma)\) be the number of inversions of a permutation \(\sigma\) and c(\(\sigma)\) the number of cycles in \(\sigma\). The author studies the relationship between i(\(\sigma)\) and c(\(\sigma)\). He shows certain extremal cases of the values of i(\(\sigma)\) for fixed c(\(\sigma)\) and enumerates those permutations which achieve these extremal values. Some extensions and open problems are also presented.
0 references
unimodal cycle
0 references
permutation
0 references
