10,356 research outputs found
A note on the arithmetic properties of Stern Polynomials
We investigate the Stern polynomials defined by ,
and for by the recurrence relations
. We prove that all possible rational
roots of that polynomials are . We give complete
characterization of such that and . Moreover, we present some result concerning
reciprocal Stern polynomials.Comment: 9 pages, submitte
Zeros and convergent subsequences of Stern polynomials
We investigate Dilcher and Stolarsky's polynomial analogue of the Stern
diatomic sequence. Basic information is obtained concerning the distribution of
their zeros in the plane. Also, uncountably many subsequences are found which
each converge to a unique analytic function on the open unit disk. We thus
generalize a result of Dilcher and Stolarsky from their second paper on the
subject.Comment: 10 pages, 1 figur
On certain arithmetic properties of Stern polynomials
We prove several theorems concerning arithmetic properties of Stern
polynomials defined in the following way: , and . We study also the
sequence e(n)=\op{deg}_{t}B_{n}(t) and give various of its properties.Comment: 20 page
Arithmetic properties of the sequence of degrees of Stern polynomials and related results
Let be a -th Stern polynomial and let e(n)=\op{deg}B_{n}(t)
be its degree. In this note we continue our study started in \cite{Ul} of the
arithmetic properties of the sequence of Stern polynomials and the sequence
. We also study the sequence
d(n)=\op{ord}_{t=0}B_{n}(t). Among other things we prove that ,
where is the maximal power of 2 which dividies the number . We also
count the number of the solutions of the equations and
in the interval . We also obtain an interesting closed expression
for a certain sum involving Stern polynomials.Comment: 16 page
The Stern diatomic sequence via generalized Chebyshev polynomials
Let a(n) be the Stern's diatomic sequence, and let x1,...,xr be the distances
between successive 1's in the binary expansion of the (odd) positive integer n.
We show that a(n) is obtained by evaluating generalized Chebyshev polynomials
when the variables are given the values x1+1, ..., xr+1, and we derive a
formula expressing the same polynomials in terms of sets of increasing integers
of alternating parity. We also show that a(n) = Det(Ir + Mr), where Ir is the
rxr identity matrix, and Mr is the rxr matrix that has x1,...,xr along the main
diagonal, then all 1's just above and below the main diagonal, and all the
other entries are 0
- …