论文部分内容阅读
We present two applications of polynomial systems in combinatorics.The first application comes from the problem of counting lattice walks restricted to the non-negative octant.We confirm the conjecture proposed by Bostan,Bousquet-Mélou,Kauers and Melczer which states that most 3-dimensional walks associate with a group of an infinity order.The second application is using polynomial system to prove Ramanujan type congruences.