Related papers: A Fibonacci analogue of the two's complement numer…
In this work, we prove the NP-completeness of two variants of tokenisation, defined as the problem of compressing a dataset to at most $\delta$ symbols by either finding a vocabulary directly (direct tokenisation), or selecting a sequence…
Balancing numbers possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of balancing numbers can be summed explicitly. For this, as a first step, a power $B_n^l$ is expressed as a linear combination of…
The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $F$ in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] - (see also [4,5]) - admits such an…
We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…
There are two well-known ways of doing arithmetic with ordinal numbers: the "ordinary" addition, multiplication, and exponentiation, which are defined by transfinite iteration; and the "natural" (or Hessenberg) addition and multiplication…
We develop a systematic and fully explicit approach to the evaluation of binomial sums involving reciprocals of binomial coefficients based on Beta integral techniques. Starting from a simple integral representation, we provide a derivation…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
We give a semantics for the lambda-calculus based on a topological duality theorem in nominal sets. A novel interpretation of lambda is given in terms of adjoints, and lambda-terms are interpreted absolutely as sets (no valuation is…
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in…
The purpose of the paper is to construct a new representation of dual quaternions called bi$-$periodic dual Fibonacci quaternions. These quaternions are originated as a generalization of the known quaternions in literature such as dual…
We introduce a total order and the absolute value function for dual numbers. The absolute value function of dual numbers are with dual number values, and have properties similar to the properties of the absolute value function of real…
We give, using higher Bernstein polynomials defined in our paper [2], a stronger version of our previous result in [1] whose converse is proved in [2] and we give some complements to the results in [2] which help to compute these higher…
Decimal-to-binary conversion is important to modern binary computers. The classical method to solve this problem is based on division operation. In this paper, we investigate a decimal-to-binary conversion method based on addition…
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof techniques for checking properties of different kinds of systems. We prove the soundness of such techniques in a fibrational setting,…
We have given full algebraic addition formulae of genus two hyperelliptic functions by the duplication method. This full addition formulae according to the duplication method give some hints of Lie group structure in addition formulae of…
We consider a family of discrete Jacobi operators on the one-dimensional integer lattice, with the diagonal and the off-diagonal entries given by two sequences generated by the Fibonacci substitution on two letters. We show that the…
A Turing machine that computes Fibonacci numbers is described.
We establish some identities relating two sequences that are, as explained, related to the Tribonacci sequence. One of these sequences bears the same resemblance to the Tribonacci sequence as the Lucas sequence does to the Fibonacci…
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…