Calculation of the number of complete mappings for permutations

被引：2

作者：

Novakovich, D ^{[1
]}

机构：

[1] Univ N London, Res Ctr STORM, London N7 8DB, England

来源：

CYBERNETICS AND SYSTEMS ANALYSIS | 2000年 / 36卷 / 02期

关键词：

complete mapping; permutation; weight of permutation;

D O I：

10.1007/BF02678671

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The computation time for counting "good" permutations rapidly grows as the length of permutations increases. The paper presents algorithms for enumeration of "good" permutations. Algorithms reducing twice the number of "good" permutations that should be counted are considered along with the algorithms employing the concept of weight of a "good" permutation.

引用

页码：244 / 247

页数：4

共 24 条

[21] On some properties of the number of permutations being products of pairwise disjoint d-cycles [J].

Miska, Piotr ;

Ulas, Maciej .

MONATSHEFTE FUR MATHEMATIK, 2020, 192 (01) :125-183

[22] On some properties of the number of permutations being products of pairwise disjoint d-cycles [J].

Piotr Miska ;

Maciej Ulas .

Monatshefte für Mathematik, 2020, 192 :125-183

[23] Coset-wise affine functions and cycle types of complete mappings [J].

Bors, Alexander ;

Wang, Qiang .

FINITE FIELDS AND THEIR APPLICATIONS, 2022, 83

[24] Partition of Abelian groups into zero-sum sets by complete mappings and its application to the existence of a magic rectangle set [J].

Cichacz, Sylwia .

JOURNAL OF ALGEBRAIC COMBINATORICS, 2025, 61 (02)

← 1 2 3 →