Abstract
AbstractWe consider the Motzkin triangle as the zero-free part of a well-defined plane array. The right diagonal leg of the triangle is the Motzkin sequence, which satisfies a second order linear recurrence with linear polynomial coefficients. We extend this relation to the parallel diagonals to the line of Motzkin sequence. More generally, we prove the existence of a recursive formula for the formation of three arbitrary elements in the triangle, and construct the corresponding formulae for three connected entries, among them diagonal triples, of twenty possible formations. These recursive formulae have bivariate polynomial coefficients of higher order. We describe the columns of the Motzkin triangle as polynomial values, and reveal nice non-trivial factorization properties of these polynomials. The results essentially depend on an initially derived recursive rule of three consecutive horizontal elements provided by the definition of the triangle, and on a construction method which creates recurrence rules for other structures.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,General Mathematics
Reference6 articles.
1. Chen, X., Wang, Y., Zheng, S.-N.: Analytic properties of combinatorial triangles related to Motzkin numbers. Discrete Math. 343(12), 112133 (2020)
2. Donaghey, R., Shapiro, L.W.: Motzkin numbers. J. Combin. Theory Ser. A 23(3), 291–301 (1977)
3. Oste, R., Van der Jeugt, J.: Motzkin paths, Motzkin polynomials and recurrence relations. Electron. J. Comb. 22(2), P2.8 (2015)
4. Sloane, N.J.A.: The on-line encyclopedia of integer sequences. https://oeis.org
5. Wang, Y., Zhang, Z.-H.: Combinatorics of generalized Motzkin numbers. J. Integer Seq. 18(2), Article 15.2.4 (2015)