Results 21 to 30 of about 7,195 (140)

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 Fibonacci Knots [PDF]

, 2009
We show that the Conway polynomials of Fibonacci links are Fibonacci polynomials modulo 2. We deduce that, when $ n \not\equiv 0 \Mod 4$ and $(n,j) \neq (3,3),$ the Fibonacci knot $ \cF_j^{(n)} $ is not a Lissajous knot.Comment: 7p ...
Koseleff, Pierre-Vincent, Pecker, Daniel
core   +2 more sources

Periodic harmonic functions on lattices and points count in positive characteristic

, 2007
This survey addresses pluri-periodic harmonic functions on lattices with values in a positive characteristic field. We mention, as a motivation, the game "Lights Out" following the work of Sutner, Goldwasser-Klostermeyer-Ware, Barua-Ramakrishnan-Sarkar ...
A.T. Amin, D. Levy, D.R. Heath-Brown, J. Goldwasser, J. Goldwasser, J.E. Humphreys, K. Sutner, M. Bhargava, M. Bicknell, M. Hunziker, M. Ram Murty, M. Zaidenberg, Mikhail Zaidenberg, O. Martin, P. Sarkar, R. Barua, R. Lidl, S. Gravier, V.E. Hoggatt Jr., V.E. Hoggatt Jr., W.A. Webb   +20 more
core   +3 more sources

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

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

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

FPGA Realization of a Novel Hyperchaos Augmented Image Encryption Algorithm

IET Computers &Digital Techniques, Volume 2026, Issue 1, 2026.
With the rapid growth of multimedia communication, protecting image data has become increasingly critical. This article proposes a novel 3‐stage hyperchaos‐based augmented image encryption technique (3SHAIET) that utilizes a three‐stage process with chaotic systems of increasing dimensionality (e.g., six‐dimensional [6D], 8D, and 9D) to enhance ...
Wassim Alexan, Noura H. Elshabasy, Eyad Mamdouh, Remas Osama, Mohamed A. Abd El Ghany, Dina El-Damak, Jim Harkin   +6 more
wiley   +1 more source

Conway polynomials of two-bridge links [PDF]

, 2012
We give necessary conditions for a polynomial to be the Conway polynomial of a two-bridge link. As a consequence, we obtain simple proofs of the classical theorems of Murasugi and Hartley.
Koseleff, P. -V., Pecker, D.
core  

Generalized Fibonacci-Lucas Polynomials

International Journal of Advanced Mathematical Sciences, 2013
Various sequences of polynomials by the names of Fibonacci and Lucas polynomials occur in the literature over a century. The Fibonacci polynomials and Lucas polynomials are famous for possessing wonderful and amazing properties and identities. In this paper, Generalized Fibonacci-Lucas Polynomials are introduced and defined by the recurrence relation 
Mamta Singh, Omprakash Sikhwal, Vibhoj Parsai, Yogesh Gupta   +3 more
openaire   +2 more sources

A Generalization of Gaussian Balancing and Gaussian Balancing‐Lucas Numbers With Applications

International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.
In this paper, we study a generalization of Gaussian balancing and Gaussian Lucas‐balancing numbers, we find their generating functions, Binet formulas, related matrix representation, and many other properties. Also, we provide some applications in cryptography.
T. Al-Asoully, A. Al-Kateeb, Abdul Rauf Khan   +2 more
wiley   +1 more source