Skip to main content
Log in

On n-arithmetical triangles constructed for polynomial coefficients

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

A fundamental solution system to a finite order linear difference equation with constant coefficients is considerably used during the investigation of the n-arithmetical triangles properties. The constructed fundamental solution system is explicitly expressed via the coefficients of the difference equation. We prove the symmetric and unimodal properties of the polynomial coefficients sequence and obtain the formulas for these coefficient calculations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondarenko, B. A. Generilized Pascal Triangles and Pyramids, Their Fractals, Graphs and Applications (FAN, Tashkent, 1990) [in Russian].

    MATH  Google Scholar 

  2. Tauber, S. “Summation Formulae forMultinomial Coefficients”, Fibonacci Quart. 3, No. 2, 95–100 (1965).

    MathSciNet  MATH  Google Scholar 

  3. Abramson, M. “Multinomial Coefficients”, Math. Mag. 41, No. 4, 199–205 (1968).

    Article  MathSciNet  MATH  Google Scholar 

  4. Hoggatt, V. E., Alexanderson, G. L. “A Property of Multinomial Coefficients”, Fibonacci Quart. 9, No. 4, 351–356 (1971).

    MathSciNet  MATH  Google Scholar 

  5. Hilliker, D. H. “On the Muitinomial Theorem”, Fibonacci Quart. 15, No. 1, 22–24 (1977).

    MathSciNet  MATH  Google Scholar 

  6. Shannon, A. G. “A Recurrence Relation for Generalized Multinomial Coefficients”, Fibonacci Quart. 17, No. 4, 344–347 (1979).

    MathSciNet  MATH  Google Scholar 

  7. Gupta, A. K. “On Pascal’s Triangle of the Third Kind”, Biometrische Z. 15, 389–392 (1973).

    Article  MathSciNet  MATH  Google Scholar 

  8. Bollinger, R. C. “ANote on Pascal-T Triangles, Multinomial Coefficients, and Pascal Pyramids”, Fibonacci Quart. 24, No. 2, 140–144 (1986).

    MathSciNet  MATH  Google Scholar 

  9. Kruglov, V. E. “Construction of a Fundamental System of Solutions of a Linear Finite-Order Difference Equation”, UkrainianMath. J. 61 (6), 923–944 (2009).

    MathSciNet  Google Scholar 

  10. Kuzmin, O. V. Generalized Pascal Pyramids and Their Applications (Nauka, Novosibirsk, 2000) [in Russian].

    Google Scholar 

  11. Aigner, M. Combinatorial Theory (Springer-Verlag, Berlin–New York, 1979; Mir,Moscow, 1982).

    MATH  Google Scholar 

  12. Shannon, A. G. “Iterative Formulas Associated with Generalized Third Order Recurrence Relations”, Siam J. Appl.Math. 23, No. 3, 364–368 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  13. Pethe, S. “Some Identities for Tribonacci Sequences”, Fibonacci Quart. 26, No. 2, 144–151 (1988).

    MathSciNet  MATH  Google Scholar 

  14. Rabinowitz, S. “AlgorithmicManipulation of Third-Order Linear Recurrences”, Fibonacci Quart. 34, No. 5, 447–464 (1996).

    MathSciNet  MATH  Google Scholar 

  15. Vilenkin, V. Ya. Combinatorics (Nauka, Moscow, 1969) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. E. Kruglov.

Additional information

Original Russian Text © V.E. Kruglov, 2016, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2016, No. 8, pp. 35–48.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kruglov, V.E. On n-arithmetical triangles constructed for polynomial coefficients. Russ Math. 60, 29–41 (2016). https://doi.org/10.3103/S1066369X16080041

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X16080041

Keywords

Navigation