Related papers: Zeckendorf arithmetic for Lucas numbers
Quaternions, split quaternions, and hybrid numbers are very well-known number systems. These number systems are used to make geometry in Euclidean and Lorentz spaces. These number systems can be obtained with the help of a quadratic form.…
In this article, we obtain the analytic continuation of the multiple shifted Lucas zeta function, multiple Lucas $L$-function associated to Dirichlet characters and additive characters. We then compute a complete list of exact singularities…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
A number theoretic algorithm is given for writing gauge theory amplitudes in a compact manner. It is possible to write down all details of the complete $L$ loop amplitude with two integers, or a complex integer. However, a more symmetric…
We use one-dimensional double affine Hecke algebras to introduce q-counterparts of the Gauss integrals and new types of Gauss-Selberg sums at roots of unity.
Truncated Fourier, Gauss, Kummer and exponential sums can be used to factorize numbers: for a factor these sums equal unity in absolute value, whereas they nearly vanish for any other number. We show how this factorization algorithm can…
Using a straightforward elementary approach, we derive numerous infinite arctangent summation formulas involving Fibonacci and Lucas numbers. While most of the results obtained are new, a couple of celebrated results appear as particular…
We present an algorithm for the classification of linear codes over finite fields, based on lattice point enumeration. We validate a correct implementation of our algorithm with known classification results from the literature, which we…
Basic elements of integral calculus over algebras of iterated differential forms, are presented. In particular, defining complexes for modules of integral forms are described and the corresponding berezinians and complexes of integral forms…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
Given two variables $s$ and $t$, the associated sequence of Lucas polynomials is defined inductively by $\{0\}=0$, $\{1\}=1$, and $\{n\}=s\{n-1\}+t\{n-2\}$ for $n\ge2$. An integer (e.g., a Catalan number) defined by an expression of the…
The paper presents a discussion on the asymptotic formula for the number of plane partitions of a large positive integer.
In the present article we introduce three new notions which are called Gaussian Mersenne Lucas numbers, Mersenne Lucas polynomials and Gaussian Mersenne Lucas polynomials. We present and prove our exciting properties and results of them…
In this paper, we describe a general method for computing Selberg-like integrals based on a formula, due to Kaneko, for Selberg-Jack integrals. The general principle consists in expanding the integrand \emph{w.r.t.} the Jack basis, which is…
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…
Zeckendorf's Theorem says that for all $k \geq 3$, every nonnegative integer has a unique $k$-Zeckendorf representation as a sum of distinct $k$-bonacci numbers, where no $k$ consecutive $k$-bonacci numbers are present in the…
We discuss existence of factorizations with linear factors for (left) polynomials over certain associative real involutive algebras, most notably over Clifford algebras. Because of their relevance to kinematics and mechanism science, we put…
Gowers norms have been a key component in the proofs of many breakthrough results in connection to the sum of digits function. Spiegelhofer has used them to show that the Thue-Morse sequence has level of distribution 1 and also that it is…