随机游动与数论.pdf

“Random Walks, Trees and Extensions of Riordan Group Techniques” by Naiomi T. Cameron Howard University Department of Mathematics Advisor: Dr. Louis Shapiro Department of Mathematics Annual Joint Mathematics Meetings Baltimore, MD January 2003 1 OUTLINE 1. Introduction • The Catalan Numbers and Their Inter- pretations/Functions Related to the Cata- lan Function • The Ternary Numbers and Generalized Dyck Paths • The Riordan Group 2. Main Results • The Chung-Feller Theorem • Analogues to Catalan-Related Functions • The Expected Number of Returns • Area Under Ternary Paths 2 3. Future Work • Determinant Sequences of the Ternary Numbers 4. Conclusion A path, P , of length n from (x0, y0) to (x, y) with step set S is a sequence of points in the plane, (x0, y0), (x1, y1), (x2 , y2), . . . , (xn , yn ) = (x, y) such that all (x − x , y − y ) ∈ S . i+1 i i+1 i The points are called vertices . The height of a vertex, v , is the ordinate of that point. A path, P , is positive if each of its vertices has nonnegative height. Dyck paths are positive paths from (0, 0) to (2n, 0) with S = {(1, 1), (1, −1)}. Below are the five Dyck paths of length 6.