中英
permute
/ pəˈmjuːt /
/ pərˈmjʊt /
  • 简明
  • 柯林斯
  • v.改变……的次序,重新排列
    • 第三人称单数

      permutes
    • 现在分词

      permuting
    • 过去式

      permuted
    • 过去分词

      permuted
  • 网络释义
  • 专业释义
  • 英英释义
  • 1

     广义转置

    ... solve求代数方程的符号解 permute广义转置 spconvert把外部数据转换为稀疏矩阵 ...

  • 2

     狭义转置

    ... peaks Matlab供给的典范三维曲面 permute 狭义转置 pi (预约义变量)圆周率 ...

  • 3

     排列

    ... permutation without repetition 无重复排列 permute 排列 perpendicular 垂直线 ...

短语
查看更多
  • 双语例句
  • 1
    Components to permute and combine into a dazzling array of services?
    组件置换,并合并为一个令人眼花缭乱的服务?
  • 2
    You can see that the rows I add are fairly pointless: I randomly permute a few possible values for each field, which is just enough to make added rows non-identical to each other.
    可以看到增加的行毫无意义:为每个字段随机排列了几种可能的值,只要添加的行互不相同就足够了。
查看更多
  • 同近义词
  • 同根词
  • 百科
  • Permute

    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.

查看更多