𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Polynomial Counterexample to the Markus–Yamabe Conjecture

✍ Scribed by Anna Cima; Arno van den Essen; Armengol Gasull; Engelbert Hubbers; Francesc Mañosas

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
256 KB
Volume
131
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

✦ Synopsis

We give a polynomial counterexample to both the Markus Yamabe conjecture and the discrete Markus Yamabe problem for all dimensions 3.

📜 SIMILAR VOLUMES

Chaotic Polynomial Automorphisms: Counte
Chaotic Polynomial Automorphisms: Counterexamples to Several Conjectures
✍ Arno van den Essen; Engelbert Hubbers 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We give a polynomial counterexample to a discrete version of the Markus᎐Yamabe conjecture and a conjecture of Deng, Meisters, and Zampieri, Ž . asserting that if F: ‫ރ‬ ª ‫ރ‬ is a polynomial map with det JF g ‫,\*ރ‬ then for all g ‫ޒ‬ large enough, F is global analytic linearizable. These counterex

A counterexample to the bold conjecture
A counterexample to the bold conjecture
✍ Sakuma, Tadashi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

A pair of vertices (x, y) of a graph G is an ω-critical pair if ω(G + xy) > ω(G), where G + xy denotes the graph obtained by adding the edge xy to G and ω(H) is the clique number of H. The ω-critical pairs are never edges in G. A maximal stable set S of G is called a forced color class of G if S mee

A Counterexample for a Conjecture about
A Counterexample for a Conjecture about the Catenarity of Polynomial Rings
✍ Mabrouk Ben Nasr; Noômen Jarboui 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 64 KB

This paper solves a long-standing open question: it is known that, if R is a Noetherian ring such that R X is catenarian, then so is R X Y , and, hence, R is universally catenarian; yet the non-Noetherian case remains unsolved. We do provide here an answer with a two-dimensional coequidimensional co

A counterexample to the rank-coloring co
A counterexample to the rank-coloring conjecture
✍ N. Alon; P. D. Seymour 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

It has been conjectured by C. van Nuffelen that the chromatic number of any graph with at least one edge does not exceed the rank of its adjacency matrix. We give a counterexample, with chromatic number 32 and with an adjacency matrix of rank 29.