相关论文: Meta-Fibonacci Sequences, Binary Trees, and Extrem…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…
A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…
In this paper, we consider the new family of recurrence sequences of $(q,k)$-generalized Fibonacci numbers. These sequences naturally extend the well-known sequences of $k$-generalized Fibonacci numbers and generalized $k$-order Pell…
A spanning tree of a graph $G$ is a connected acyclic spanning subgraph of $G$. We consider enumeration of spanning trees when $G$ is a $2$-tree, meaning that $G$ is obtained from one edge by iteratively adding a vertex whose neighborhood…
We study the bounded regions in a generic slice of the hyperplane arrangement in $\mathbb{R}^n$ consisting of the hyperplanes defined by $x_i$ and $x_i+x_j$. The bounded regions are in bijection with several classes of combinatorial…
The subtrees and BC-subtrees (subtrees where any two leaves are at even distance apart) have been extensively studied in recent years. Such structures, under special constraints on degrees, have applications in many fields. Through an…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
We characterize clique trees of a chordal graph in their relation to simplicial vertices and perfect sequences of maximal cliques. We investigate boundary cliques defined by Shibata and clarify their relation to endpoints of clique trees.…
The objective of this manuscript is to offer explicit expressions for diverse categories of infinite series incorporating the Fibonacci (Lucas) sequence and the Riemann zeta function. In demonstrating our findings, we will utilize…
For many meta-Fibonacci sequences it is possible to identify a partition of the sequence into successive intervals (sometimes called blocks) with the property that the sequence behaves "similarly" in each block. This partition provides…
This study applies the binomial, k-binomial, rising k-binomial and falling k-binomial transforms to the modified k-Fibonacci-like sequence. Also, the Binet formulas and generating functions of the above mentioned four transforms are newly…
We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…
In this paper, we construct Pell matrices, analogous to Fibonacci matrices, to study algebraic properties of Pell numbers via linear algebra. This framework yields identities involving the trace, inverse, and determinant, as well as matrix…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
In this paper, we study the theory of the harmonic and the hyperharmonic Fibonacci numbers. Also, we get some combinatoric identities like as harmonic and hyperharmonic numbers and we obtain some useful formulas for $\mathbb{F}_{n}$, which…
We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…
The sequence of partial sums of Fibonacci numbers, beginning with $2$, $4$, $7$, $12$, $20$, $33,\dots$, has several combinatorial interpretations (OEIS A000071). For instance, the $n$-th term in this sequence is the number of length-$n$…
The rank (also known as protection number or leaf-height) of a vertex in a rooted tree is the minimum distance between the vertex and any of its leaf descendants. We consider the sum of ranks over all vertices (known as the security) in…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…