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
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu