Results 41 to 50 of about 316 (181)

Structure and Computation

Noûs, EarlyView.
ABSTRACT It is a truism of mathematics that differences between isomorphic number systems are irrelevant to arithmetic. This truism is deeply rooted in the modern axiomatic method and underlies most strands of arithmetical structuralism, the view that arithmetic is about some abstract number structure.
Balthasar Grabmayr
wiley   +1 more source

A New Class of q-Fibonacci Polynomials [PDF]

The Electronic Journal of Combinatorics, 2003
We introduce a new $q$-analogue of the Fibonacci polynomials and derive some of its properties. Extra attention is paid to a special case which has some interesting connections with Euler's pentagonal number theorem.
openaire   +3 more sources

Total Variation Regularized GRACE(‐FO) Inversion

Journal of Geophysical Research: Solid Earth, Volume 131, Issue 5, May 2026.
Abstract Gravity estimation from satellite‐satellite tracking missions such as GRACE(‐FO) is an ill‐posed inverse problem. The conventional approach to regularized inversion of GRACE(‐FO) measurements uses L2 ${L}_{2}$‐Tikhonov regularization with a heuristic constraint matrix derived based on knowledge of spatiotemporal distribution of the signal ...
G. Jacob, S. Bettadpur, H. Save, P. Nagel, F. Wang   +4 more
wiley   +1 more source

Fibonacci Wavelet Method for the Solution of the Non-Linear Hunter–Saxton Equation

Applied Sciences, 2022
In this article, a novel and efficient collocation method based on Fibonacci wavelets is proposed for the numerical solution of the non-linear Hunter–Saxton equation. Firstly, the operational matrices of integration associated with the Fibonacci wavelets
H. M. Srivastava, Firdous A. Shah, Naied A. Nayied   +2 more
doaj   +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

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

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

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