Results 51 to 60 of about 302 (175)

Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms

Decision Sciences, Volume 57, Issue 2, Page 95-116, April 2026.
Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham, Alex Kuiper, Robert H. Lee   +2 more
wiley   +1 more source

On Generalized Fibonacci Polynomials: Horadam Polynomials

Earthline Journal of Mathematical Sciences, 2022
In this paper, we investigate the generalized Fibonacci (Horadam) polynomials and we deal with, in detail, two special cases which we call them $(r,s)$-Fibonacci and $(r,s)$-Lucas polynomials. We present Binet's formulas, generating functions, Simson's formulas, and the summation formulas for these polynomial sequences.
openaire   +2 more sources

On the Chebyshev polynomials and some of their new identities

Advances in Difference Equations, 2020
The main purpose of this paper is, using the elementary methods and properties of the power series, to study the computational problem of the convolution sums of Chebyshev polynomials and Fibonacci polynomials and to give some new and interesting ...
Di Han, Xingxing Lv
doaj   +1 more source

Traces of Hecke operators on Drinfeld modular forms for GL2(Fq[T])$\operatorname{GL}_2(\mathbb {F}_q[T])$

Mathematika, Volume 72, Issue 2, April 2026.
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley   +1 more source

Fibonacci polynomials

Pure and Applied Mathematics Quarterly
The Fibonacci polynomials $\big\{F_n(x)\big\}_{n\ge 0}$ have been studied in multiple ways. In this paper we study them by means of the theory of Heaps of Viennot. In this setting our polynomials form a basis $\big\{P_n(x)\big\}_{n\ge 0}$ with $P_n(x)$ monic of degree $n$. This given, we are forced to set $P_n(x)=F_{n+1}(x)$.
Garsia, A., Ganzberger, G.
openaire   +2 more sources

Generalized Fibonacci Polynomials [PDF]

Turkish Journal of Analysis and Number Theory, 2016
In this study, we present generalized Fibonacci polynomials. We have used their Binet’s formula and generating function to derive the identities. The proofs of the main theorems are based on special functions, simple algebra and give several interesting properties involving them.
Yashwant K. Panwar, B. Singh, V.K. Gupta
openaire   +1 more source

Zarankiewicz bounds from distal regularity lemma

Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
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

Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results

Software: Practice and Experience, Volume 56, Issue 1, Page 26-41, January 2026.
ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley   +1 more source

Permutation properties of the Fibonacci polynomials

四川大学学报. 自然科学版, 2020
The permutation polynomials has wide and important applications in the fields of algebra, combinatorics, number theory, coding theory, cryptography, and so on.
Wang Zhi-Jian
doaj