PERMUTATIONS WITH A GIVEN NUMBER OF INVERSIONS
Abstract
In this paper a kind of generalized Pascal triangle is coustructed whose k'th entry in its n'th row equals the number of permutations of degree n having exactly k inversions. Let p~ be the number of the n-degree permutations having: exactly le inversions. Then pk J1 (n) , 1 > ') T • O. if k - <0 so it is presented an algorithm which needs polynomial time only: P k-J1-;-l 11-1 • Finally it is given a method that the n'th row of our GPT contains 1 -'- (~) (non-zero) entries and the computation of the n'th row requires roughly n4 operations.
How to Cite
Balcza, L. “PERMUTATIONS WITH A GIVEN NUMBER OF INVERSIONS ”, Periodica Polytechnica Civil Engineering, 31(1-2), pp. 51–54, 1987.
Issue
Section
Research Article
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (see The Effect of Open Access). As soon as the paper is accepted, finally submitted and edited, the paper will appear in the "OnlineFirst" page of the journal, thus from this point no other internet-based publication is necessary.

