AbstractLetfandgbe polynomials over some field, thought of as elements of the ring of one-sided Laurent series, and suppose that degf<degg. The quotientf/gisbadly approximableif all the partial quotients of the continued fraction expansion off/ghave degree 1. We investigate the set of polynomials which occur as the denominatorsgof badly approximable quotientsf/g. Such polynomials arise in stream cipher theory (part of cryptography) as the minimal polynomials of sequences with perfect linear complexity profile. They also occur in the theory of linear cellular automata and in the analysis of certain pseudorandom number generators
We study elements of second order linear recurrence sequences (Gn)n=0 of polynomials in C[x] which a...
AbstractA theorem of G. Pòlya states that an entire function of exponential order less than 1 or of ...
Every function from a finite field to itself can be represented by a polynomial. The functions which...
AbstractLetfandgbe polynomials over some field, thought of as elements of the ring of one-sided Laur...
AbstractLet theorthogonal multiplicityof a monic polynomialgover a field F be the number of polynomi...
AbstractLet F be a finite field with q elements and let g be a polynomial in F[X] with positive degr...
We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polyno...
AbstractWe construct a sequence ofd-dimensional classical orthogonalpolynomials (d⩾2) that generaliz...
AbstractLetk=GF(q) be the finite field of orderq. Letf1(x),f2(x)∈k[x] be monic relatively prime poly...
AbstractA function f is considered in the form of its formal series expansion ∑k=0∞fkPk where (Pk)k=...
We present several generalisations of the Games- Chan algorithm. For a fixed monic irreducible polyn...
AbstractPending its publication in full detail, the theory of recursive generation of systems of ort...
We reconsider some families of orthogonal polynomials, within the framework of the so called mo...
AbstractAn algorithm is considered, and shown to lead to various unusual and unique series expansion...
AbstractWe generalize Abhyankar–Mohʼs theory of approximate roots of polynomials to the case of appr...
We study elements of second order linear recurrence sequences (Gn)n=0 of polynomials in C[x] which a...
AbstractA theorem of G. Pòlya states that an entire function of exponential order less than 1 or of ...
Every function from a finite field to itself can be represented by a polynomial. The functions which...
AbstractLetfandgbe polynomials over some field, thought of as elements of the ring of one-sided Laur...
AbstractLet theorthogonal multiplicityof a monic polynomialgover a field F be the number of polynomi...
AbstractLet F be a finite field with q elements and let g be a polynomial in F[X] with positive degr...
We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polyno...
AbstractWe construct a sequence ofd-dimensional classical orthogonalpolynomials (d⩾2) that generaliz...
AbstractLetk=GF(q) be the finite field of orderq. Letf1(x),f2(x)∈k[x] be monic relatively prime poly...
AbstractA function f is considered in the form of its formal series expansion ∑k=0∞fkPk where (Pk)k=...
We present several generalisations of the Games- Chan algorithm. For a fixed monic irreducible polyn...
AbstractPending its publication in full detail, the theory of recursive generation of systems of ort...
We reconsider some families of orthogonal polynomials, within the framework of the so called mo...
AbstractAn algorithm is considered, and shown to lead to various unusual and unique series expansion...
AbstractWe generalize Abhyankar–Mohʼs theory of approximate roots of polynomials to the case of appr...
We study elements of second order linear recurrence sequences (Gn)n=0 of polynomials in C[x] which a...
AbstractA theorem of G. Pòlya states that an entire function of exponential order less than 1 or of ...
Every function from a finite field to itself can be represented by a polynomial. The functions which...