Results 51 to 60 of about 466,283 (262)
, 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
MathematicsMaking use of generalized bivariate Fibonacci polynomials, we propose two families of regular functions of the type ϕ(ζ)=ζ+∑j=2∞djζj, which are bi-univalent in the disc {ζ∈C:|ζ|
S. R. Swamy +3 more
semanticscholar +1 more source
Distance Fibonacci Polynomials by Graph Methods
Symmetry, 2021 In this paper we introduce and study a new generalization of Fibonacci polynomials which generalize Fibonacci, Jacobsthal and Narayana numbers, simultaneously. We give a graph interpretation of these polynomials and we obtain a binomial formula for them.
D. Strzałka, S. Wolski, A. Włoch
semanticscholar +1 more source
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
Novel Expressions for Certain Generalized Leonardo Polynomials and Their Associated Numbers
AxiomsThis article introduces new polynomials that extend the standard Leonardo numbers, generalizing Fibonacci and Lucas polynomials. A new power form representation is developed for these polynomials, which is crucial for deriving further formulas.
Waleed Mohamed Abd-Elhameed +3 more
doaj +1 more source
On Convolved Generalized Fibonacci and Lucas Polynomials [PDF]
, 2013 We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials.
Ramírez, José L.
core
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 +20 more
core +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
Extended Fibonacci numbers and polynomials with probability applications
International Journal of Mathematics and Mathematical Sciences, 2004 The extended Fibonacci sequence of numbers and polynomials is introduced and studied. The generating function, recurrence relations, an expansion in terms of multinomial coefficients, and several properties of the extended Fibonacci numbers and ...
Demetrios L. Antzoulakos
doaj +1 more source
(Random) Trees of Intermediate Volume Growth
Random Structures &Algorithms, Volume 67, Issue 4, December 2025.ABSTRACT For every function g:ℝ≥0→ℝ≥0$$ g:{\mathbb{R}}_{\ge 0}\to {\mathbb{R}}_{\ge 0} $$ that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree T$$ T $$ of uniform volume growth g$$ g $$, or more precisely, C1·g(r/4)≤|BG(v,r)|≤C2·g(4r),for allr≥0andv∈V(T),$$ {C}_1\cdotp g\left(r/4\right)\le \
George Kontogeorgiou, Martin Winter
wiley +1 more source