理学 >>> 数学 >>> 组合数学 >>>
搜索结果: 1-4 共查到组合数学 permutations相关记录4条 . 查询时间(0.078 秒)
Permutation patterns is a popular area of research introduced in 1968, but with roots going to the work of Leonhard Euler in 1749.
We prove that the Mahonian-Stirling pairs of permutation statistics $(\sor, \cyc)$ and $(\inv, \mathrm{rlmin})$ are equidistributed on the set of permutations that correspond to arrangements of $n$ no...
For each integer k >= 2, let F(k) denote the largest n for which there exists a permutation \sigma \in S_n, all of whose patterns of length k are distinct. We prove that F(k) = k + \lfloor \sqrt{2k-3}...
We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...