Related papers: On (a,b) Pairs in Random Fibonacci Sequences
A fringe subtree of a rooted tree is a subtree induced by one of the vertices and all its descendants. We consider the problem of estimating the number of distinct fringe subtrees in two types of random trees: simply generated trees and…
Fibonomial coefficients count the number of specific finite birth self-similar subposets of an infinite non-tree poset naturally related to the Fibonacci tree of rabbits growth process.
Fomin and Zelevinsky show that a certain two-parameter family of rational recurrence relations, here called the (b,c) family, possesses the Laurentness property: for all b,c, each term of the (b,c) sequence can be expressed as a Laurent…
In this paper, we propose a class of growth models, named Fibonacci trees $F(t)$, with respect to the intrinsic advantage of Fibonacci sequence $\{F_{t}\}$. First, we turn out model $F(t)$ to have power-law degree distribution with exponent…
Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
The Fibonacci numbers are a sequence of integers in which every number after the first two, 0 and 1, is the sum of the two preceding numbers. These numbers are well known and algorithms to compute them are so easy that they are often used…
We use the group $(\Z^2,+)$ and two associated homomorphisms, $\tau_0, \tau_1$, to generate all distinct, non-zero pairs of coprime, positive integers which we describe within the context of a binary tree which we denote $T$. While this…
Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative integers with $k_1\le k_2$. In this paper,…
For a pair consisting of a gene tree and a species tree, the ancestral configurations at an internal node of the species tree are the distinct sets of gene lineages that can be present at that node. Ancestral configurations appear in…
We consider various properties and manifestations of some sign-alternating univariate polynomials borne of right-triangular integer arrays related to certain generalizations of the Fibonacci sequence. Using a theory of the root geometry of…
We develop algorithms, implemented in Maple, that study the number of vertices with a particular number of children in a random ordered tree where all vertices must have a number of children in some finite set. By calculating the mixed…
We study the subgraph of the Young-Fibonacci graph induced by elements with odd $f$-statistic (the $f$-statistic of an element $w$ of a differential graded poset is the number of saturated chains from the minimal element of the poset to…
The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…
We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…
An attempt to come closer to a resolution of the Collatz conjecture is presented. The central idea is the formation of a tree consisting of positive odd numbers with number 1 as root. Functions for generating the tree from the root are…
Tree-child networks are one of the most prominent network classes for modeling evolutionary processes which contain reticulation events. Several recent studies have addressed counting questions for {\it bicombining tree-child networks}…
We show that there is a non-empty class of finitely additive probabilities on $\mathbb N^2$ such that for each member of the class, each set with limiting relative frequency $p$ has probability $p$. Hence, in that context the probability…
The number of tree-rooted maps, that is, rooted planar maps with a distinguished spanning tree, of size $n$ is C(n)C(n+1) where C(n)=binomial(2n,n)/(n+1) is the nth Catalan number. We present a (long awaited) simple bijection which explains…