Results 81 to 90 of about 524,049 (276)

Strong bounds and exact solutions to the minimum broadcast time problem

International Transactions in Operational Research, Volume 32, Issue 1, Page 314-352, January 2025.
Abstract Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast time problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step, the sources and the nodes that already have received the signal can forward it to at most one of their
Marika Ivanova, Dag Haugland, Bård Hennning Tvedt   +2 more
wiley   +1 more source

Efficient Recovery of Linear Predicted Coefficients Based on Adaptive Steepest Descent Algorithm in Signal Compression for End‐to‐End Communications

Journal of Electrical and Computer Engineering, Volume 2025, Issue 1, 2025.
The efficiency of recovery and signal decoding efficacy at the receiver in end‐to‐end communications using linearly predicted coefficients are susceptible to errors, especially for highly compressed signals. In this paper, we propose a method to efficiently recover linearly predicted coefficients for high signal compression for end‐to‐end ...
Abel Kamagara, Abbas Kagudde, Baris Atakan, Andrea Tani   +3 more
wiley   +1 more source

Some Properties of Generalized Apostol-Type Frobenius–Euler–Fibonacci Polynomials

Mathematics
In this paper, by using the Golden Calculus, we introduce the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and numbers; additionally, we obtain various fundamental identities and properties associated with these polynomials and numbers,
Maryam Salem Alatawi, Waseem Ahmad Khan, Can Kızılateş, Cheon Seoung Ryoo   +3 more
doaj   +1 more source

Some identities for the generalized Fibonacci polynomials by the Q(x) matrix [PDF]

arXiv, 2020
In this note, we obtain some identities for the generalized Fibonacci polynomial by using the Q(x) matrix. These identities including the Cassini identity and Honsberger formula can be applied to some polynomial sequences, such as Fibonacci polynomials, Lucas polynomials, Pell polynomials, Pell-Lucas polynomials, Fermat polynomials, Fermat-Lucas ...
arxiv  

Fibonacci sums and divisibility properties [PDF]

arXiv, 2023
Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum relations, the main identities will be shown to be very useful in establishing and discovering divisibility ...
arxiv  

Cube Polynomial of Fibonacci and Lucas Cubes [PDF]

Acta Applicandae Mathematicae, 2011
The cube polynomial of a graph is the counting polynomial for the number of induced k-dimensional hypercubes (k?0). We determine the cube polynomial of Fibonacci cubes and Lucas cubes, as well as the generating functions for the sequences of these cubes.
Klavzar, Sandi, Mollard, Michel
openaire   +3 more sources

Subordination Properties of Bi‐Univalent Functions Involving Horadam Polynomials

Journal of Function Spaces, Volume 2025, Issue 1, 2025.
In this research, we investigate a family of q‐extensions defined on an open unit disk, which is based on bi‐univalent functions associated with differential subordination. Next, we define certain classes of bi‐univalent functions using generalized Horadam polynomials.
Ebrahim Amini, Shrideh Al-Omari, Abdul Rauf Khan   +2 more
wiley   +1 more source

Novel Classes on Generating Functions of the Products of (p,q)-Modified Pell Numbers with Several Bivariate Polynomials

Mathematics
In this paper, using the symmetrizing operator δe1e22−l, we derive new generating functions of the products of p,q-modified Pell numbers with various bivariate polynomials, including Mersenne and Mersenne Lucas polynomials, Fibonacci and Lucas ...
Ali Boussayoud, Salah Boulaaras, Ali Allahem   +2 more
doaj   +1 more source

A New Generalization of Leonardo Sequences: Biperiodic Leonardo Sequence

Journal of Mathematics, Volume 2025, Issue 1, 2025.
In this study, we define a new type of number sequence called biperiodic Leonardo sequence by the recurrence relation Lena,b=aLen−1+Len−2+1 (for even n) and Lena,b=bLen−1+Len−2+1 (for odd n) with the initial conditions Le0a,b=Le1a,b=1. We obtained the characteristic function, generating function, and Binet’s formula for this sequence and propose a ...
Hasan Gökbaş, Mohammad W. Alomari
wiley   +1 more source

On the power sums problem of bi-periodic Fibonacci and Lucas polynomials

AIMS Mathematics
This paper mainly discussed the power sums of bi-periodic Fibonacci and Lucas polynomials. In addition, we generalized these results to obtain several congruences involving the divisible properties of bi-periodic Fibonacci and Lucas polynomials.
Tingting Du , Li Wang
doaj   +1 more source