Related papers: Note on a Fibonacci Parity Sequence
The question of how to certify the non-negativity of a polynomial function lies at the heart of Real Algebra and it also has important applications to Optimization. In the setting of symmetric polynomials Timofte provided a useful way of…
Fault tree (FT) analysis is a prominent risk assessment method in industrial systems. Unreliability is one of the key safety metrics in quantitative FT analysis. Existing algorithms for unreliability analysis are based on binary decision…
A family of multi-parameter, polynomially deformed oscillators (PDOs) given by polynomial structure function \phi(n) is studied from the viewpoint of being (or not) in the class of Fibonacci oscillators. These obey the Fibonacci…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
Explicit formulas for complexity and unique invariant measure of the period-doubling subshift can be derived from those for the Thue-Morse subshift, obtained by Brlek, De Luca and Varricchio, and Dekking. In this note we give direct proofs…
In this paper, we prove a few lemmas concerning Fibonacci numbers modulo primes and provide a few statements that are equivalent to Wall-Sun-Sun Prime Conjecture. Further, we investigate the conjecture through heuristic arguments and…
The Thue--Morse sequence $\{t(n)\}_{n\geqslant 1}$ is the indicator function of the parity of the number of ones in the binary expansion of positive integers $n$, where $t(n)=1$ (resp. $=0$) if the binary expansion of $n$ has an odd (resp.…
In this paper we give an introduction to the volume conjecture and its generalizations. Especially we discuss relations of the asymptotic behaviors of the colored Jones polynomials of a knot with different parameters to representations of…
We introduce and study two analogs of one of the best known sequence in Mathematics : Thue-Morse sequence. The first analog is concerned with the parity of number of runs of 1's in the binary representation of nonnegative integers. The…
Let $f_1,...,f_d$ be an orthogonal basis for the space of cusp forms of even weight $2k$ on $\Gamma_0(N)$. Let $L(f_i,s)$ and $L(f_i,\chi,s)$ denote the $L$-function of $f_i$ and its twist by a Dirichlet character $\chi$, respectively. In…
We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…
We study the behavior of a polynomial sequence which is defined by iterating a polynomial pair under Thue-Morse dynamic. We show that in suitable sense, the sequence will behave like $\{2\cos 2^nx: n\ge 1\}$. Basing on this property we can…
Let ${\mathcal F}=(F_i:i\ge 0)$ be the sequence of Fibonacci numbers, and $j$ and $e$ be non negative integers. We study the periodicity of the power Fibonacci sequences ${\mathcal F}^e(F_j)=(F_i^e\pmod{F_j}: i\ge 0)$. It is shown that for…
The colored Jones function of a knot is a sequence of Laurent polynomials. It was shown by TTQ. Le and the author that such sequences are $q$-holonomic, that is, they satisfy linear $q$-difference equations with coefficients Laurent…
A unitarily invariant projective framework is introduced to analyze the complexity of path-following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill-posedness, is given. A Newton map…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9], thus settling, based on previously developed machinery,…
We give a Montessus de Ballore type theorem for row sequences of Hermite-Pad\'e approximations of vector valued analytic functions refining some results in this direction due to P.R. Graves-Morris and E.B. Saff. We do this introducing the…
The reason why Cooley-Tukey Fast Fourier Transform (FFT) over $\mathbb{Q}$ can be efficiently implemented using complex roots of unity is that the cyclotomic extensions of the completion $\mathbb{R}$ of $\mathbb{Q}$ are at most quadratic,…
By using Andrews's explicit formulae of the $q$-Fibonacci sequence introduced by Schur, we prove certain congruences of the $q$-Fibonacci sequence which relate the sequence with the original Fibonacci sequence. As a corollary, we show that…