理学 >>> 数学 >>> 组合数学 >>>
搜索结果: 1-6 共查到组合数学 enumeration相关记录6条 . 查询时间(0 秒)
Enumeration of all combinatorial types of point configurations and polytopes is a fundamental problem in combinatorial geometry. Although many studies have been done, most of them are for 2-dimensiona...
Abstract: The enumeration of standard Young tableaux (SYTs) of shape {\lambda} can be easily computed by the hook-length formula. In 1981, Amitai Regev proved that the number of SYTs having at most th...
Abstract: A redundant generating function is a generating function having terms which are not part of the solution of the original problem. We use redundant generating functions to study two path prob...
Abstract: We enumerate the number of 0/1-matrices avoiding 2x2 submatrices satisfying certain conditions. We also provide corresponding exponential generating functions.
We study the area distribution of closed walks of length n, begin-ning and ending at the origin. The concept of area of a walk in the square lattice is generalized and the usefulness of the new concep...
We present a combinatorial method to determine the dimension of H-strata in the algebra of m  n quantum matrices Oq(Mm;n(K)) as follows. To a given H-stratum we associate a certain permutation via th...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...