Right Circulant Matrices with Generalized Fibonacci and Lucas Polynomials and Coding Theory

2017/12/21 by Sümeyra Uçar, Uçar, Sümeyra, Nihal Yılmaz Özgür +1
Mathematics · Physics and Astronomy · #11B37 #14G50 #15A15 #68P30 #Advanced Combinatorial Mathematics #Advanced Mathematical Theories and Applications #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Number Theory (math.NT) #Primary 11B39

paper · pdf · doi:10.48550/arxiv.1801.01766

openalex publication_date 2017/12/21 · openalex created_date 2018/01/12 · openalex updated_date 2026/07/28

Abstract

In this paper, we give two new coding algorithms by means of right circulant matrices with elements generalized Fibonacci and Lucas polynomials. For this purpose, we study basic properties of right circulant matrices using generalized Fibonacci polynomials F_p,q,n( x) , generalized Lucas polynomials L_p,q,n( x) and geometric sequences.

Citations

• Asymptotic and Periodic Boundary Value Problems of Mixed FDEs and Wave Solutions of Lattice Differential Equations

Related

• Fibonacci polynomials, generalized Stirling numbers, and Bernoulli, Genocchi and tangent numbers
• On the properties of circulant matrices involving Generalized Tribonacci and Generalized Tribonacci-Lucas numbers
• Special Matrices Associated with Generalized Fibonacci Numbers
• Generalized Lucas Numbers and Relations with Generalized Fibonacci Numbers
• On the spectra of g-circulant matrices and applications