Difference equations arise in various areas of mathematics. Together with the method of generating functions, they yield a powerful machinery for studying enumeration problems in combinatorial analysis (see, e.g. [1]). Another source of difference equations is the discretization of differential equations. For instance, the discretization of Cauchy-Riemann equations led to the appearance of the theory of discrete analytic functions (see, e.g. [2, 3]) which found applications in the theory of Reimannian surfaces and combinatorial analysis (see, e.g. [4, 5]). The methods of discretization of a differential problem comprise an important part of the theory of difference schemes, and they also lead to difference equations (see, e.g. [6]). The theory of difference schemes is exploring ways of constructing difference schemes, explores the challenges posed difference and the convergence of the solution of the difference problem to the solution of the original differential problem, engaged justification of algorithms for solving problems of difference. An important place among these are correct. We define the shift operators δj with respect to the variables xj : δjf (x) = f (x1, . . . , xj−1, xj + 1, xj+1, . . . , xn), and polynomial difference operator of the form
Read full abstract