Multiplicative character sums for nonlinear recurring sequences
Given a binary recurrence , we consider the Diophantine equation with nonnegative integer unknowns , where for 1 ≤ i < j ≤ L, , and K is a fixed parameter. We show that the above equation has only finitely many solutions and the largest one can be explicitly bounded. We demonstrate the strength of our method by completely solving a particular Diophantine equation of the above form.
Let , and be fixed complex numbers. Let be the Toeplitz matrix all of whose entries above the diagonal are , all of whose entries below the diagonal are , and all of whose entries on the diagonal are . For , each principal minor of has the same value. We find explicit and recursive formulae for the principal minors and the characteristic polynomial of . We also show that all complex polynomials in are Toeplitz matrices. In particular, the inverse of is a Toeplitz matrix when...