理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-11 共查到数学 enumeration相关记录11条 . 查询时间(0.06 秒)
The number of PL-homeomorphism types of combinatorial manifolds in a fixed dimension with an upper bound on g2 is finite.
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.
Let UTn(q) denote the unitriangular group of unipotent n×n upper triangular matrices over a field with q elements. The numbers which appear as the degrees of the complex irreducible characters of UT...
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...
Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman estab...
Product formulas for the number of standard Young tableaux of truncated shifted staircase and truncated rectangular shapes are given.
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...
In this paper we prove that the number of translation equivalence classes of linear recurring m-arrays over F_q with period (r,s) is(φ(rs))/(log_q(rs+1)), where φ is Euler function.

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...