Guy Degla
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Guy Degla has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Awaou Lare Ousseni
Institut de Mathématiques et de Sciences Physiques (IMSP) , Université d’Abomey-Calavi (UAC) , Dangbo Benin
5 shared publications - Japhet Odjoumani
Institut de Mathématiques et de Sciences Physiques (IMSP) , Université d’Abomey-Calavi (UAC) , Dangbo Benin
5 shared publications - Babacar Mbaye Ndiaye
University of Cheikh Anta Diop
3 shared publications - Ezra Daniel Dzarma3 shared publications
- Theophile Komlan Dagba
University of Abomey-Calavi
3 shared publications - Gemechis File Duressa
Department of Mathematics, Jimma University, Jimma, Ethiopia
2 shared publications
Latest Publications
- Open Access
- 20 July 2026
- Published by Elsevier in Partial Differential Equations in Applied Mathematics
- Vol. 19
Error analysis for a nonconforming finite element discretization of the 3D-CCPF model
- 20 July 2026
- Published by Elsevier in Partial Differential Equations in Applied Mathematics
- Vol. 19
Open AccessError analysis for a nonconforming finite element discretization of the 3D-CCPF model
- 1 April 2026
- Published by Springer Nature
- p. 214-224
Data-Driven Maize Yield Optimization in North-East Nigeria: Analysis of Random Forest and Ordinary Least Square Regression
- 1 April 2026
- Published by Springer Nature
- p. 214-224
Data-Driven Maize Yield Optimization in North-East Nigeria: Analysis of Random Forest and Ordinary Least Square Regression
- 1 April 2026
- Published by Springer Nature
- p. 274-280
Maize Productivity Optimization: An Analysis of Hybrid, Cobb-Douglas, and CES Models
- 1 April 2026
- Published by Springer Nature
- p. 274-280
Maize Productivity Optimization: An Analysis of Hybrid, Cobb-Douglas, and CES Models
- 6 February 2026
- Published by Springer Nature
- p. 46-55
Comparative Analysis of Feature Importance and Correlation of Soil Components in Maize Cultivation Using Machine Learning
- 6 February 2026
- Published by Springer Nature
- p. 46-55
Comparative Analysis of Feature Importance and Correlation of Soil Components in Maize Cultivation Using Machine Learning
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Diophantine Equation Involving Powers of 3 and a Tribonacci‐Lucas Number
Let S n be the Tribonacci‐Lucas sequence. In this paper, we solve the Diophantine equation S n − 3 m = c for a fixed integer c and variable positive integers n and m . We find all integers c admitting at least two representations as a difference between a Tribonacci‐Lucas number and a power of 3.
- 1 January 2026
- Published by Wiley in Journal of Mathematics
- Vol. 2026 (1)
Open AccessDiophantine Equation Involving Powers of 3 and a Tribonacci‐Lucas Number
Let S n be the Tribonacci‐Lucas sequence. In this paper, we solve the Diophantine equation S n − 3 m = c for a fixed integer c and variable positive integers n and m . We find all integers c admitting at least two representations as a difference between a Tribonacci‐Lucas number and a power of 3.
- Open Access
- 1 January 2026
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2026 (1) , 2018690
Effective Bounds for Narayana Numbers that Admit Zeckendorf Partition in k Terms: Explicit Results for k ∈ {3, 4}
The mathematician Zeckendorf proved that every positive integer has a unique decomposition into a sum of distinct and nonconsecutive Fibonacci numbers, known as the Zeckendorf partition. Let be the Narayana’s cows sequence given by N 0 = N 1 = N 2 = 1 and N m +3 = N m +2 + N m , for m ≥ 0. A term of this sequence is called a Narayana number. In this paper, we applied the linear forms in logarithms to the Zeckendorf decomposition of the Narayana cow’s sequence . We give effective computable bounds for the decomposition. As applications, we explicitly determine all the Narayana numbers that admit a Zeckendorf partition into exactly three terms or exactly four terms.
- 1 January 2026
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2026 (1) , 2018690
Open AccessEffective Bounds for Narayana Numbers that Admit Zeckendorf Partition in k Terms: Explicit Results for k ∈ {3, 4}
The mathematician Zeckendorf proved that every positive integer has a unique decomposition into a sum of distinct and nonconsecutive Fibonacci numbers, known as the Zeckendorf partition. Let be the Narayana’s cows sequence given by N 0 = N 1 = N 2 = 1 and N m +3 = N m +2 + N m , for m ≥ 0. A term of this sequence is called a Narayana number. In this paper, we applied the linear forms in logarithms to the Zeckendorf decomposition of the Narayana cow’s sequence . We give effective computable bounds for the decomposition. As applications, we explicitly determine all the Narayana numbers that admit a Zeckendorf partition into exactly three terms or exactly four terms.
- Open Access
- 1 January 2026
- Published by Walter de Gruyter GmbH in Annals of West University of Timisoara - Mathematics and Computer Science
- Vol. 62 (1) , 72-91
Bounds for the k -term Zeckendorf representations of Tribonacci-Lucas numbers with explicit results
Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. In this paper, we applied the linear forms in logarithms to the Zeckendorf representation of the Tribonacci-Lucas sequences to find effective computable bounds for the representation. We then used a version of the Baker-Davenport reduction method to explicitly determine all the Tribonacci-Lucas numbers that admit a Zeckendorf representation into exactly five terms. We found that there are exactly two Tribonacci-Lucas, namely S 11 and S 14 , that admit Zeckendorf representation into five terms.
- 1 January 2026
- Published by Walter de Gruyter GmbH in Annals of West University of Timisoara - Mathematics and Computer Science
- Vol. 62 (1) , 72-91
Open AccessBounds for the k -term Zeckendorf representations of Tribonacci-Lucas numbers with explicit results
Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. In this paper, we applied the linear forms in logarithms to the Zeckendorf representation of the Tribonacci-Lucas sequences to find effective computable bounds for the representation. We then used a version of the Baker-Davenport reduction method to explicitly determine all the Tribonacci-Lucas numbers that admit a Zeckendorf representation into exactly five terms. We found that there are exactly two Tribonacci-Lucas, namely S 11 and S 14 , that admit Zeckendorf representation into five terms.
- Open Access
- 1 January 2026
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2026 (1)
On the Two‐Term Zeckendorf Representations of the Padovan and Perrin Sequences
In this paper, we completely solve the Diophantine equations P m = F n + F k and E m = F n + F k under the condition n ≥ k + 2 ≥ 4, where P m is the m ‐th Padovan number, E m is the m ‐th Perrin number, and F k is the k ‐th Fibonacci number. This work determines all terms of the Padovan and Perrin sequences that admit a unique two‐term Zeckendorf representation. Our approach relies on lower bounds for linear forms in logarithms of algebraic numbers via Baker′s method, combined with the Baker–Davenport reduction procedure to reduce the large initial upper bounds. We show that the only Padovan numbers satisfying this property are {4, 7, 9,16,37}, corresponding to the indices m ∈ {7, 9, 10,12,15}, and the only Perrin numbers are {7,10,22,29,39,68,90,644}, corresponding to the indices m ∈ {7, 8, 11,12,13,15,16,23}.
- 1 January 2026
- Published by Wiley in Journal of Applied Mathematics
- Vol. 2026 (1)
Open AccessOn the Two‐Term Zeckendorf Representations of the Padovan and Perrin Sequences
In this paper, we completely solve the Diophantine equations P m = F n + F k and E m = F n + F k under the condition n ≥ k + 2 ≥ 4, where P m is the m ‐th Padovan number, E m is the m ‐th Perrin number, and F k is the k ‐th Fibonacci number. This work determines all terms of the Padovan and Perrin sequences that admit a unique two‐term Zeckendorf representation. Our approach relies on lower bounds for linear forms in logarithms of algebraic numbers via Baker′s method, combined with the Baker–Davenport reduction procedure to reduce the large initial upper bounds. We show that the only Padovan numbers satisfying this property are {4, 7, 9,16,37}, corresponding to the indices m ∈ {7, 9, 10,12,15}, and the only Perrin numbers are {7,10,22,29,39,68,90,644}, corresponding to the indices m ∈ {7, 8, 11,12,13,15,16,23}.
- 1 December 2025
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 32 (4) , 128
On the solutions of the Diophantine equation involving powers of 2 and a Tribonacci–Lucas number
- 1 December 2025
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 32 (4) , 128
On the solutions of the Diophantine equation involving powers of 2 and a Tribonacci–Lucas number
- 22 July 2025
- Published by Springer Nature
- p. 221-234
Optimization and Prediction of Crop Yields with Machine Learning: A Bibliometric Analysis
- 22 July 2025
- Published by Springer Nature
- p. 221-234
Optimization and Prediction of Crop Yields with Machine Learning: A Bibliometric Analysis