Sign Up to like & get
recommendations!
0
Published in 2019 at "Mathematics in Computer Science"
DOI: 10.1007/s11786-018-0364-2
Abstract: We define Euclid polynomials $$E_{k+1}(\lambda ) = E_{k}(\lambda )\left( E_{k}(\lambda ) - 1\right) + 1$$Ek+1(λ)=Ek(λ)Ek(λ)-1+1 and $$E_{1}(\lambda ) = \lambda + 1$$E1(λ)=λ+1 in analogy to Euclid numbers $$e_k = E_{k}(1)$$ek=Ek(1). We show how to construct…
read more here.
Keywords:
companion;
height companion;
minimal height;
matrices euclid ... See more keywords