Results 41 to 50 of about 26,336 (246)

Non-Fisherian generalized Fibonacci numbers [PDF]

Notes on Number Theory and Discrete Mathematics
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

On Third-Order Bronze Fibonacci Numbers

Mathematics, 2021
In this study, we firstly obtain De Moivre-type identities for the second-order Bronze Fibonacci sequences. Next, we construct and define the third-order Bronze Fibonacci, third-order Bronze Lucas and modified third-order Bronze Fibonacci sequences. Then,
Mücahit Akbiyik, Jeta Alo
doaj   +1 more source

Generalized Fibonacci sequences in groupoids [PDF]

Advances in Difference Equations, 2013
Abstract In this paper, we introduce the notion of generalized Fibonacci sequences over a groupoid and discuss it in particular for the case where the groupoid contains idempotents and pre-idempotents. Using the notion of Smarandache-type P-algebra, we obtain several relations on groupoids which are derived from generalized Fibonacci ...
Kim, Hee, Neggers, J, So, Keum
openaire   +1 more source

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

Bidiagonal Decompositions and Accurate Computations for the Ballot Table and the Fibonacci Matrix

Numerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.
ABSTRACT Riordan arrays include many important examples of matrices. Here we consider the ballot table and the Fibonacci matrix. For finite truncations of these Riordan arrays, we obtain bidiagonal decompositions. Using them, algorithms to solve key linear algebra problems for ballot tables and Fibonacci matrices with high relative accuracy are derived.
Jorge Ballarín, Jorge Delgado, J. M. Peña   +2 more
wiley   +1 more source

$p$-regularity of the $p$-adic valuation of the Fibonacci sequence [PDF]

, 2015
We show that the $p$-adic valuation of the sequence of Fibonacci numbers is a $p$-regular sequence for every prime $p$. For $p \neq 2, 5$, we determine that the rank of this sequence is $\alpha(p) + 1$, where $\alpha(m)$ is the restricted period length ...
Medina, Luis A., Rowland, Eric
core   +1 more source

Cores with distinct parts and bigraded Fibonacci numbers

, 2017
The notion of $(a,b)$-cores is closely related to rational $(a,b)$ Dyck paths due to Anderson's bijection, and thus the number of $(a,a+1)$-cores is given by the Catalan number $C_a$.
Paramonov, Kirill
core   +1 more source

Entanglement in Quantum Systems Based on Directed Graphs

Advanced Quantum Technologies, Volume 9, Issue 1, January 2026.
The entanglement properties of quantum states associated with directed graphs are investigated. It is proved that the vertex degree distribution fully determines this entanglement measure, which remains invariant under vertex relabeling, thereby highlighting its topological character.
Lucio De Simone, Roberto Franzosi
wiley   +1 more source

KAJIAN BARISAN FIBONACCI DAN APLIKASINYA PADA SUKU BARISAN YANG POSITIF [PDF]

, 2009
In general, the problems that occur in the fibonacci sequence is to determine the n- tribe ( ) . So to find , so please be at least two tribes, regardless of the number-the number that are in sequence if the number is positive ornegative. \ud , From the
Rofitasari, Rosma
core  

Generalized Fibonacci – Like Sequence Associated with Fibonacci and Lucas Sequences [PDF]

Turkish Journal of Analysis and Number Theory, 2016
The Fibonacci sequence, Lucas numbers and their generalization have many interesting properties and applications to almost every field. Fibonacci sequence is defined by the recurrence formula Fn=Fn-1+Fn-2, , and F0=0, F1=1, where Fn is a nth number of sequence.
Yogesh Kumar Gupta, Mamta Singh, Omprakash Sikhwal   +2 more
openaire   +1 more source