Description and generation of permutations containing cycles

Authors:
I. V. Grebennik
Affiliations:
Kharkov National University of Radioelectronics, Kharkov, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 10
Cited 0

Enumerative combinatorics

Enumerative combinatorics
Combinatorial algorithms: generation, enumeration, and search

ACM SIGACT News
Combinatorics of Permutations

Combinatorics of Permutations
Features of Formation and Ordering of Samples

Cybernetics and Systems Analysis
The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions

The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)

The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)
Generatingfunctionology

Generatingfunctionology
Method of ordering the values of a linear function on a set of permutations

Cybernetics and Systems Analysis
A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements

Cybernetics and Systems Analysis
A modification of the method of combinatorial truncation in optimization problems over vertex-located sets

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proposes a general approach to generating permutations that contain cycles, based on constructive tools introduced to describe combinatorial sets. Different generation problems for permutations of definite class are formulated and solved. A combinatorial set is introduced to define permutations represented as the multiplication of a definite number of cycles. For this set, combinatorial species and associated generating series are constructed.