๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polynomial maps and a conjecture of Samuelson

โœ Scribed by Arno van den Essen; T. Parthasarathy

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
268 KB
Volume
177
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Proof of a Chromatic Polynomial Conjectu
Proof of a Chromatic Polynomial Conjecture
โœ F.M. Dong ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 138 KB

Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))

A New Class of Invertible Polynomial Map
A New Class of Invertible Polynomial Maps
โœ Arno van den Essen; Engelbert Hubbers ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 175 KB

In this paper we present a new large class of polynomial maps F s X q H : A n n ลฝ . ยช A Definition 1.1 on every commutative ring A for which the Jacobian Conjecture is true. In particular H does not need to be homogeneous. We also ลฝ . show that for all H in this class satisfying H 0 s 0 the nth iter