排序方式: 共有1条查询结果,搜索用时 31 毫秒
1
1.
We use the Lindström–Gessel–Viennot Theorem to count nonintersecting lattice paths in a carefully chosen acyclic weighted digraph to give a visual combinatorial proof of Vandermonde's classic determinant. 相似文献
1