On Polynomial Decompositions
✍ Scribed by J. Klüners
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 374 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
✦ Synopsis
We present a new polynomial decomposition which generalizes the functional and homogeneous bivariate decomposition of irreducible monic polynomials in one variable over the rationals. With these decompositions it is possible to calculate the roots of an imprimitive polynomial by solving polynomial equations of lower degree.
📜 SIMILAR VOLUMES
Let H (x) be a monic polynomial over a finite field F = GF(q). Denote by N a (n) the number of coefficients in H n which are equal to an element a ∈ F, and by G the set of elements a ∈ F × such that N a (n) > 0 for some n. We study the relationship between the numbers (N a (n)) a∈G and the patterns
## Abstract We introduce a Littlewood–Paley decomposition related to any sub‐Laplacian on a Lie group __G__ of polynomial volume growth; this allows us to prove a Littlewood–Paley theorem in this general setting and to provide a dyadic characterization of Besov spaces __B__ ^__s,q__^ ~__p__~ (__G_