✦ LIBER ✦

Polynomials in a Single Ordinal Variable

✍ Scribed by John L. Hickman

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 414 KB
Volume: 25
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19790250709

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Class of Polynomial Equations in a Sin

A Class of Polynomial Equations in a Single Ordinal Variable

✍ John L. Hickman 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

HOMOGENEOUS FORMS IN TWO ORDINAL VARIABL

HOMOGENEOUS FORMS IN TWO ORDINAL VARIABLES

✍ John L. Hickman 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB

HONOGENEOUS FORMS IN TWO ORDINAL VARIABLES by JOHN L. HICRMaN in Canberra, A.C.T. (Australia)') We are interested in the number of ordinal solutions to the general equation F = a, where F is the two-variable form z(z'y"r,,; r + s = t ) with x , y ordinal variables, a an infinite ordinal constant, t

Some q-Polynomials in two Variables

✍ Leonard Carlitz 📂 Article 📅 1958 🏛 John Wiley and Sons 🌐 English ⚖ 414 KB

Reducibility of Polynomials in Two Varia

Reducibility of Polynomials in Two Variables

✍ D. Lorenzini 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Computation of Hilbert Polynomials in Tw

Computation of Hilbert Polynomials in Two Variables

✍ 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

A Polynomial Time Algorithm for Diophant

A Polynomial Time Algorithm for Diophantine Equations in One Variable

✍ F CUCKER; P KOIRAN; S SMALE 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We exhibit an algorithm computing, for a polynomial f ∈ Z [t], the set of its integer roots. The running time of the algorithm is polynomial in the size of the sparse encoding of f .