𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reducibility of Polynomials in Two Variables

✍ Scribed by D. Lorenzini


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
360 KB
Volume
156
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Some q-Polynomials in two Variables
✍ Leonard Carlitz πŸ“‚ Article πŸ“… 1958 πŸ› John Wiley and Sons 🌐 English βš– 414 KB
Computation of Hilbert Polynomials in Tw
✍ Alexander Levin πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 474 KB

Let R be a ring of polynomials in m + n indeterminates x 1 , . . . , xm, y 1 , . . . , yn over a field K and let M be a finitely generated R-module. Furthermore, let (Rrs) r,s∈N be the natural double filtration of the ring R and let (Mrs) r,s∈N be the corresponding double filtration of the module M

Reducibility of Cubic Polynomials modp
✍ Wolfgang M. Ruppert πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 251 KB

It is shown that an absolutely irreducible homogeneous cubic polynomial f # Z[x 0 , x 1 , x 2 ] is also absolutely irreducible mod p if p>1248H 6 where H is the height of f. Modulo a general number theoretic conjecture an example shows that the result is best possible.

Stieltjes Type Theorems for Orthogonal P
✍ Zhong-xuan Luo; Ren-hong Wang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 111 KB

In this paper, some important properties of orthogonal polynomials of two variables are investigated. The concepts of invariant factor for orthogonal polynomials of two variables are introduced. The presented results include Stieltjies type theorems for multivariate orthogonal polynomials and the co

Lagrange polynomials of a complex variab
✍ R. H. T. Bates; M. O. Milner πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 458 KB

## Abstract We recognize that established techniques permit two‐dimensional interpolation to be accomplished efficiently as well as accurately when the grid of points, on which the data is available, is regular. Existing methods suitable for irregular grids are computationally protracted. We show t