Related papers: A Fibonacci analogue of the two's complement numer…
We characterize the symbolical dynamical systems which are topologically isomorphic to the Fibonacci dynmaical system. We prove that there are infinitely many injective primitive substitutions generating a dynamical system in the Fibonacci…
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 investigate decidability of equivalence of register transducers, also called copyful Streaming String Transducers in case of string input, extended with an operation of substituting a register for all occurrences of a given letter in…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
The bisimulation proof method can be enhanced by employing `bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and…
I consider the expansion of transcendental functions in a small parameter around rational numbers. This includes in particular the expansion around half-integer values. I present algorithms which are suitable for an implementation within a…
A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…
We consider the structure of a variation of the Fibonacci sequence which is determined by a Bernoulli process. The associated structure of all Bernoulli variations of the Fibonacci sequence can be represented by a directed binary tree,…
It is shown how Dedekind cuts can be used to introduce the extended real numbers along with sound arithmetic laws via one simple rule for the addition of sets. The crucial idea is that the use of the lower and the upper part of the cuts,…
By means of the Bessel operator a polynomial sequence is constructed to which several properties are given. Among them, its explicit expression, the connection with the Euler numbers, its integral representation via the Kontorovich-Lebedev…
In this paper, we provide new applications of Fibonacci and Lucas numbers. In some circumstances, we find algebraic structures on some sets defined with these numbers, we generalize Fibonacci and Lucas numbers by using an arbitrary binary…
There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…
In this paper, we introduce a bilateral adding machine based on a zip space with two sets of alphabets. We demonstrate that these adding machines are homeomorphisms and provide necessary and sufficient conditions for their characterization.
Two observables are called complementary if preparing a physical object in an eigenstate of one of them yields a completely random result in a measurement of the other. We investigate small sets of complementary observables that cannot be…
Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative representation of integers with much use in efficient…
The implementation of a quaternary 1-digit adder composed of a 2-bit binary adder, quaternary to binary decoders and binary to quaternary encoders is compared with several recent implementations of quaternary adders. This simple…
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
We use generalised Zeckendorf representations of natural numbers to investigate mixing properties of symbolic dynamical systems. The systems we consider consist of bi-infinite sequences associated with so-called random substitutions. We…
Let $D$ be a bounded Lipschitz domain of $\mathbb{R}^d$. We consider the complement value problem $$ \left\{\begin{array}{l}(\Delta+a^{\alpha}\Delta^{\alpha/2}+b\cdot\nabla+c)u+f=0\ \ {\rm in}\ D,\\ u=g\ \ {\rm on}\ D^c.…
In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport…