9 citations · 23 across the 38 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
math.NT2011
On the reducibility type of trinomials
Andrew Bremner, Maciej Ulas
Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degree…
math.CO2011
Arithmetic properties of the sequence of degrees of Stern polynomials and related results
Maciej Ulas
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 t…
math.CO2011
On certain arithmetic properties of Stern polynomials
Maciej Ulas, Oliwia Ulas
We prove several theorems concerning arithmetic properties of Stern polynomials defined in the following way: , and $B_{2n+1}(t)=B_{n}(…