%0 Journal Article
%T Generation of Some Permutations and Involutions with Dependence Degree ＞1<br>一些非一次相关置换和对合的产生方法
%A TAO Ren-ji
%A CHEN Shi-hua
%A <br>陶仁骥
%A 陈世华
%J 软件学报
%D 1998
%I 
%X 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.
%K Latin square
%K dependence
%K permutation
%K involution<br>拉丁阵，相关，置换，对合.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=F0EC7CD81F21F6AD&yid=8CAA3A429E3EA654&vid=9CF7A0430CBB2DFD&iid=E158A972A605785F&sid=4B1FFFA116F7AE3B&eid=627456E7977439A4&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=12