✦ LIBER ✦

A Note on Polynomial Reduction

✍ Scribed by Alyson Reeves; Bernd Sturmfels

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 137 KB
Volume: 16
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1993.1045

No coin nor oath required. For personal study only.

✦ Synopsis

The reduction relation modulo a marked set of polynomials is Noetherian if and only if the marking is induced from an admissible term order.

📜 SIMILAR VOLUMES

A Note on Derivatives of Bernstein Polyn

A Note on Derivatives of Bernstein Polynomials

✍ D.X. Zhou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 92 KB

A Note on Approximation by Bernstein Pol

A Note on Approximation by Bernstein Polynomials

✍ T.F. Xie; S.P. Zhou 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 161 KB

By establishing an identity for \(S_{n}(x):=\sum_{j=0}^{n}|j / n-x|\left({ }_{j}^{n}\right) x^{j}(1-x)^{n-j}\), the present paper shows that a pointwise asymptotic estimate cannot hold for \(S_{n}(x)\), and, at the same time, obtains a better result than that in Bojanic and Cheng [3]. 1993 Academic

A note on the estimation of polynomial d

A note on the estimation of polynomial distributed lags

✍ Johannes Ledolter 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB 👁 3 views

A Note on Weighted Polynomial Approximat

A Note on Weighted Polynomial Approximation with Varying Weights

✍ A.B.J. Kuijlaars 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 199 KB

It is shown that if weighted polynomials w n P n with deg P n n converge uniformly on the support of the extremal measure associated with w, then they converge to 0 everywhere else. It is also shown that uniform approximation on the support can always be characterized by a closed subset Z having the

Another Note on Polynomial vs Rational A

Another Note on Polynomial vs Rational Approximation

✍ Boris Shekhtman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Let E be a subspace of C(X) and let R(E)= gÂh: g, h # E ; h>0]. We make a simple, yet intriguing observation: if zero is a best approximation to f from E, then zero is a best approximation to f from R(E ). We also prove that if That extends the results of P. Borwein and S. Zhou who proved it for t

A Note on Graph Colorings and Graph Poly

A Note on Graph Colorings and Graph Polynomials

✍ Noga Alon; Michael Tarsi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 230 KB

## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using