Generation of Some Permutations and Involutions with Dependence Degree >1
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In this paper, the authors deal with the generation of permutations and involutions with dependence degree >1. For permutation, they first give a method of generating a kind of permutations with the same dependence degree by affine transformations to a given permutation, then a recursive method of generating higher dimensional permutations from lower ones, and numbers of permutations generated by these methods are evaluated. For involution, the authors give a method of generating involutions with dependence degree >1 by making p disjoint transpositions with the same distance from fixed points of a given involution, and a loose lower bound of numbers of such generated involutions.

    Reference
    Related
    Cited by
Get Citation

陶仁骥,陈世华.一些非一次相关置换和对合的产生方法.软件学报,1998,9(4):251-255

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 11,1996
  • Revised:May 07,1997
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063