Degree-k linear recursions mod(p) and number fields
Trueman MacHenry, Kieh Wong
Abstract
Linear recursions of degree k are determined by evaluating the sequence of Generalized Fibonacci Polynomials, \Fk,n(t1,...,tk)\ (isobaric reflects of the complete symmetric polynomials) at the integer vectors (t1,...,tk). If Fk,n(t1,...,tk) = fn, then fn - Σj=1k tj fn-j = 0, and \fn\ is a linear recursion of degree k. On the one hand, the periodic properties of such sequences modulo a prime p are discussed, and are shown to be related to the prime structure of certain algebraic number fields; for example, the arithmetic properties of the period are shown to characterize ramification of primes in an extension field. On the other hand, the structure of the semilocal rings associated with the number field is shown to be completely determined by Schur-hook polynomials. Keywords: Symmetric polynomials, Schur polynomials, linear recursions, number fields.
Create a lesson
Related papers
Almost primes in short intervals and averages of long Dirichlet polynomial approximations to (ζ'/ζ)k
Siegfred Baluyot, John Brian Conrey, Ayesha Irfan et al.
On the Diophantine equation Cx2+p12m1p22m2·s pk2mk=yq
Usha K. Sangale, Priyanka R. Satpute
Asymptotics for partitions over the Fibonacci numbers and related sequences, II
Michael Coons, Simon Kristensen, Mathias L. Laursen
Inverse powers and 2-adic properties of binary 3 x 3 matrices associated with the Tribonacci sequence
Wilson Arley Martinez, Samin Ingrith Ceron
Counting irreducible skew polynomials x2n+axn+1
Tomoya Hayata, Takahiro Tsushima
Finding Integer Roots of Polynomials in Nearly Optimal Time
Yansong Feng, Itamar Nir