Generalizations of Pólya's theorem on random walks obtained via an extension of the symbolic method in enumerative combinatorics. I

We use our extension of a fragment of the symbolic method in enumerative combinatorics when we allow finite sums defining the coefficients of generating functions to become infinite series to generalize Pólya's theorem on random walks. Pólya's theorem determines limits of the probabilities that walk