An efficient Gray code algorithm for generating all permutations with a given major index (Q2447540): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A CAT algorithm for generating permutations with a fixed number of inversions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3659988 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4288077 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Restricted compositions and permutations: from old to new Gray codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new Euler-Mahonian constructive bijection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4504909 / rank | |||
Normal rank | |||
Latest revision as of 11:30, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient Gray code algorithm for generating all permutations with a given major index |
scientific article |
Statements
An efficient Gray code algorithm for generating all permutations with a given major index (English)
0 references
28 April 2014
0 references
generating algorithms permutations
0 references
(bounded) compositions of an integer
0 references
major index
0 references
