Enumeration of lattice paths using Vieta polynomials

Read full text Summarise with VIRAT
Authors: Marilena Jianu, Leonard Dăuş
Cited by: 0
References: 20

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Dyck-type lattice paths, consisting of up and down diagonal steps on the integer lattice, can be either unconfined ? if the only restriction is to remain in the non-negative half-plane ? or confined, if, in addition, they are not allowed to pass above a fixed horizontal line. In this paper, we establish a formula for the number of unconfined Dyck-type lattice paths of a given length, and also investigate the enumeration of confined Dyck-type paths, deriving recurrence relations involving Vieta-Fibonacci polynomials.

Fields of Study & Subjects

Advanced Combinatorial Mathematics Advanced Mathematical Identities Mathematical functions and polynomials

Publication details

Journal / source
Applicable Analysis and Discrete Mathematics
Issue
00
Pages
6–6
Publication date
1 January 2026
Language
EN