More Fibonacci-Bernoulli relations with and without balancing polynomials
From MaRDI portal
Publication:5164441
Abstract: We continue our study on relationships between Bernoulli polynomials and balancing (Lucas-balancing) polynomials. From these polynomial relations, we deduce new combinatorial identities with Fibonacci (Lucas) and Bernoulli numbers. Moreover, we prove a special identity involving Bernoulli polynomials and Fibonacci numbers in arithmetic progression. Special cases and some corollaries will highlight interesting aspects of our findings. Our results complement and generalize these of Frontczak (2019).
Recommendations
- Relating Fibonacci numbers to Bernoulli numbers via balancing polynomials
- Additional Fibonacci-Bernoulli relations
- Combinatorial sums associated with balancing and Lucas-balancing polynomials
- A note on Fibonacci \& Lucas and Bernoulli \& Euler polynomials
- Lucas-Euler relations using balancing and Lucas-balancing polynomials
Cites work
- scientific article; zbMATH DE number 6686825 (Why is no real title available?)
- scientific article; zbMATH DE number 6497230 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 1750098 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- scientific article; zbMATH DE number 775176 (Why is no real title available?)
- scientific article; zbMATH DE number 862502 (Why is no real title available?)
- A Geometric Construction of a $[110,5,90]_{9}$-Linear Code Admitting the Mathieu Group $M_{11}$
- All Geometries of the Mathieu Group MllBased on Maximal Subgroups
- An atlas of subgroup lattices of finite almost simple groups
- Block designs and strongly regular graphs admitting a transitive action of the Mathieu group \(M_{11}\)
- Codes from incidence matrices and line graphs of Hamming graphs
- Constructing some designs invariant under \(\mathrm{PSL}_2(q)\), \(q\) even
- Designs and codes from \(\mathrm{PSL}_2(q)\)
- Designs from maximal subgroups and conjugacy classes of Ree groups
- Distance-transitive representations of the sporadic groups
- Finding possible permutation characters
- On flag-transitive 2-(v,k,2) designs
- On the automorphisms of designs constructed from finite simple groups
- Some designs invariant under the Suzuki groups
- Some graphs related to the small Mathieu groups
- The Finite Simple Groups
- The Magma algebra system. I: The user language
- The multiplicity-free permutation characters of the sporadic simple groups and their automorphism groups
Cited in
(7)- Lucas-Euler relations using balancing and Lucas-balancing polynomials
- Relating Fibonacci numbers to Bernoulli numbers via balancing polynomials
- Combinatorial sums associated with balancing and Lucas-balancing polynomials
- Additional Fibonacci-Bernoulli relations
- Hybrid convolutions on Pell and Lucas polynomials
- Additional close links between balancing and Lucas-balancing polynomials
- scientific article; zbMATH DE number 7640637 (Why is no real title available?)
This page was built for publication: More Fibonacci-Bernoulli relations with and without balancing polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164441)
