[数] 置换
置换(Permutation)是古典密码中另一种基本的处理技巧,就是将明文中的字母重新排 列,字母本身不变,只是改变其位置。
[数] 排列
...的组件仅用于例示本发明的系统。如本领域技术人员将意识到并且将从下面的讨论中显现出来的,本发明的组件的组合的排列(permutation)是重要的。这里没有讨论的每个这样的变体也落在本发明的范围内。
变换
... permselectivity 选择通透性 permutation 变换,置换;摆列 peroxidase 过氧化物酶 ...
交换
... permissive a.许可的,获准的,自由的 permutation n.交换,排列 pernicious a.有害的,恶性的,致命的,险恶的 ...
数 置换群 ; 数 排列群
数 排列矩阵
数 循环排列 ; 环形排列 ; 圆形排列 ; 循环交替变换
In mathematics, the notion of permutation relates to the act of rearranging, or permuting, all the members of a set into some sequence or order (unlike combinations, which are selections of some members of the set where order is disregarded). For example, written as tuples, there are six permutations of the set {1,2,3}, namely: (1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), and (3,2,1). As another example, an anagram of a word, all of whose letters are different, is a permutation of its letters. The study of permutations of finite sets is a topic in the field of combinatorics.Permutations occur, in more or less prominent ways, in almost every area of mathematics. They often arise when different orderings on certain finite sets are considered, possibly only because one wants to ignore such orderings and needs to know how many configurations are thus identified. For similar reasons permutations arise in the study of sorting algorithms in computer science.The number of permutations of n distinct objects is n factorial usually written as n!, which means the product of all positive integers less than or equal to n.In algebra and particularly in group theory, a permutation of a set S is defined as a bijection from S to itself. That is, it is a function from S to S for which every element occurs exactly once as an image value. This is related to the rearrangement of the elements of S in which each element s is replaced by the corresponding f(s). The collection of such permutations form a group called the symmetric group of S. The key to this group's structure is the fact that the composition of two permutations (performing two given rearrangements in succession) results in another rearrangement. Permutations may act on structured objects by rearranging their components, or by certain replacements (substitutions) of symbols.In elementary combinatorics, the k-permutations, or partial permutations, are the ordered arrangements of k distinct elements selected from a set. When k is equal to the size of the set, these are the permutations of the set.
点击反馈