Related papers: Describe the Fibonacci map by principal nests
Let ${\cal P}$ be the set of palindromes occurring in the Fibonacci sequence. In this note, we establish three structures of $\mathcal{P}$ and and discuss their properties: cylinder structure, chain structure and recursive structure. Using…
In this first paper, we look at the following question: are the properties of the Fibonacci tree still true if we consider a finitely generated tree by the same rules but rooted at a black node? The direct answer is no, but new properties…
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
In this paper, we introduce the concept of principal bundles on statistical manifolds. After necessary preliminaries on information geometry and principal bundles on manifolds, we study the $\alpha$-structure of frame bundles over…
The notion of a translation map in a quantum principal bundle is introduced. A translation map is then used to prove that the cross sections of a quantum fibre bundle $E(B,V,A)$ associated to a quantum principal bundle $P(B,A)$ are in…
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…
Interaction nets are a graphical model of computation, which has been used to define efficient evaluators for functional calculi, and specifically lambda calculi with patterns. However, the flat structure of interaction nets forces pattern…
In this paper, we consider the generalized Fibonacci quaternion which is the Horadam quaternion sequence. Then we used the Binet's formula to show some properties of the Horadam quaternion. We get some generalized identities of the Horadam…
We propose a refinement of the Betti numbers and of the homology with coefficients in a field of a compact ANR in the presence of a continuous real valued function. The refinement of Betti numbers consists of finite configurations of points…
We study the basic properties of a prime sum graph, which is a simple graph defined on $\mathbb N$ where two vertices are adjacent if and only if their sum is a prime number. Further, we investigate some specific structures that appear…
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive $1$s. Munarini introduced Pell graphs, a variation of Fibonacci cubes defined on ternary strings. A generalization of Pell graphs…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
In this paper, domination in Signed Petri net(SPN) has been introduced.We identify some of the Petri net structures where a dominating set can exist.Applications of producer consumer problem, searching of food by bees and finding similarity…
Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.
We give a combinatorial characterization of nodal curves admitting a natural d-th Abel map to their Picard scheme, for any positive integer d. "Natural" here means compatible with and independent of specialization.
The Fibonacci sequence is obtained as weighted sum along the rows in the Pascal triangle by choosing a periodic up-and-down pattern of weights from the set $\{-1,-\frac{1}{2},0, \frac{1}{2}, 1\}$. A graphical illustration of this identity…
The book is devoted to constructing embedding finite-dimensional maps into trivial bundles and investigating the corresponding general position properties.