Results 51 to 60 of about 4,031 (226)
On Recursive Hyperbolic Fibonacci Quaternions
Many quaternions with the coefficients selected from special integer sequences such as Fibonacci and Lucas sequences have been investigated by a great number of researchers.
Ahmet Daşdemir
doaj +1 more source
Some Properties of Fibonacci Numbers, Generalized Fibonacci Numbers and Generalized Fibonacci Polynomial Sequences [PDF]
In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence modulo an integer, $m$ and derive certain interesting properties related to them.
Laugier, Alexandre, Saikia, Manjil P.
openaire +3 more sources
Style Brush: Guided Style Transfer for 3D Objects
We introduce Style Brush, a guided 3D style‐transfer method for textured meshes that provides precise creative control. It supports the use of multiple style images, smooth transitions and intuitive guidance, producing visually appealing textures that follow user intent as we demonstrate in our user study and results. Abstract We introduce Style Brush,
Áron Samuel Kovács +2 more
wiley +1 more source
A note on ratios of Fibonacci hybrid and Lucas hybrid numbers
Irmak recently asked an open question related to divisibility properties of Fibonacci and Lucas quaternions [4, p. 374]. In this paper, we give an answer to Fibonacci and Lucas hybrid number version of this question.
Emrah Polatlı
core +1 more source
We introduce a function which measures the number of distinct ways in which a number can be expressed as the sum of Fibonacci numbers. Using a binary table and other devices, we explore the values that can take and reveal some interesting patterns.
John E Baker, Steve Sugden
core +1 more source
Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
A permutation $π\in S_n$ is said to {\it avoid} a permutation $σ\in S_k$ whenever $π$ contains no subsequence with all of the same pairwise comparisons as $σ$. For any set $R$ of permutations, we write $S_n(R)$ to denote the set of permutations in $S_n$ which avoid every permutation in $R$.
Egge, Eric S., Mansour, Toufik
openaire +3 more sources
Scalable Computation of Topological Abstractions for Scalar Data
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
We prove an exact formula for OEIS A000119, which counts partitions into distinct Fibonacci numbers.
Slattery, Tom, Chow, Sam
core +1 more source
Non-Fisherian generalized Fibonacci numbers [PDF]
Using biology as inspiration, this paper explores a generalization of the Fibonacci sequence that involves gender biased sexual reproduction. The female, male, and total population numbers along with their associated recurrence relations are considered ...
Thor Martinsen
doaj +1 more source
Spectral properties of two coupled Fibonacci chains
The Fibonacci chain, i.e. a tight-binding model where couplings and/or on-site potentials can take only two different values distributed according to the Fibonacci word, is a classical example of a one-dimensional quasicrystal.
Anouar Moustaj +4 more
doaj +1 more source

