Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2010.00125

Novel Results of Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals

W. M. Abd-Elhameed·N. A. Zeyada·A. N. Philippou
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper is concerned with developing some new connection formulae between two generalized classes of Fibonacci and Lucas polynomials. All the connection coefficients involve hypergeometric functions of the type $_2F_{1}(z)$, for certain $z$. Several new connection formulae between some famous polynomials such as Fibonacci, Lucas, Pell, Fermat, Pell-Lucas, and Fermat-Lucas polynomials are deduced as special cases of the derived connection formulae. Some of the introduced formulae generalize some of those existing in the literature. As two applications of the derived connection formulae, some new formulae linking some celebrated numbers are given and also some newly closed formulae of certain definite weighted integrals are deduced. Based on using the two generalized classes of Fibonacci and Lucas polynomials, some new reduction formulae of certain odd and even radicals are developed.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

W. M. Abd-Elhameed, N. A. Zeyada, A. N. Philippou. 2020-09-30. Novel Results of Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals. https://arxiv.org/abs/2010.00125

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗