Related papers: A Fibonacci analogue of the two's complement numer…
A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…
We apply the Desnanot-Jacobi identity to give an alternative proof of the determinants whose entries are rising powers of the Fibonacci numbers given by Prodinger. We then generalize the determinants to include entries that are rising…
We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…
By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…
This paper explores whether or not a complete ternary full adder, whose input variables can independently be '0', '1', or '2', is indispensable in the arithmetic blocks of adder, subtractor, and multiplier. Our investigations show that none…
We define a pairing map $\pi_{\mathsf{CL}} : \mathbb{N}^2\to\mathbb{N}$ that encodes $x$ and $y$ into two disjoint bands of Zeckendorf indices separated by a delimiter computed from $x$. The construction is "carryless" by design: the…
In \cite{Oz}, M. \"Ozdemir defined a new non-commutative number system called hybrid numbers. In this paper, we define the hybrid Fibonacci and Lucas numbers. This number system can be accepted as a generalization of the complex…
We introduce the degenerate Bernoulli numbers of the second kind as a degenerate version of the Bernoulli numbers of the second kind. We derive a family of nonlinear differential equations satisfied by a function closely related to the…
We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
We derive new infinite series involving Fibonacci numbers and Riemann zeta numbers. The calculations are facilitated by evaluating linear combinations of polygamma functions of the same order at certain arguments.
By studying Cameron's operator in terms of determinants, two kinds of "integer" sequences of incomplete numbers were introduced. One was the sequence of restricted numbers, including $s$-step Fibonacci sequences. Another was the sequence of…
We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent…
We study arithmetical aspects of Ito-Sadahiro number systems with negative base. We show that the bases $-\beta<-1$, where $\beta$ is zero of $x^3-mx^2-mx-m,\ m\in\mathbb N,$ possess the so-called finiteness property. For the Tribonacci…
In this work we discuss Dirichlet products evaluated at Fibonacci numbers. As first applications of the results we get a representation of Fibonacci numbers in terms of Euler's totient function, an upper bound on the number of primitive…
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
We construct sets $A, B$ in a vector space over $\mathbb{F}_2$ with the property that $A$ is "statistically" almost closed under addition by $B$ in the sense that $a + b$ almost always lies in $A$ when $a \in A, b \in B$, but which is…
The Fibonomial coefficients are well-known analogues of the classical binomial coefficients. In 2009, Sagan and Savage introduced a combinatorial interpretation for these coefficients, based on tiling a rectangular grid. More recently,…