✦ LIBER ✦

About a conjecture on Nagata rings

✍ Scribed by Ahmed Ayache

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 289 KB
Volume: 98
Category: Article
ISSN: 0022-4049
DOI: 10.1016/0022-4049(95)90009-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Nagata's Conjecture

✍ Brian Harbourne 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 119 KB

This paper gives an improved lower bound on the degrees d such that for general points p 1 p n ∈ P 2 and m > 0 there is a plane curve of degree d vanishing at each p i with multiplicity at least m.

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

On a conjecture about monochromatic flat

On a conjecture about monochromatic flats

✍ Yanling Yang 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 257 KB

On a conjecture about the hypoenergetic

On a conjecture about the hypoenergetic trees

✍ Jianping Liu; Bolian Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 308 KB

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. An n-vertex graph G is said to be hypoenergetic if E(G) < n. In Gutman et al. (2008) [14] the authors conjectured that there exist n-vertex hypoenergetic trees with maximum degree ∆ = 4 for any n ≡ 2 mod 4, n > 2

About a conjecture on quadratic vector f

About a conjecture on quadratic vector fields

✍ Jean Moulin Ollagnier 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 85 KB

The Lotka-Volterra system of autonomous di erential equations consists in three homogeneous polynomial equations of degree 2 in three variables. This system, or the corresponding vector ÿeld LV (A; B; C), depends on three non-zero (complex) parameters and may be written as LV (A; B; C) = Vx@x + Vy@y

On a conjecture about edge irregular tot

On a conjecture about edge irregular total labelings

✍ Stephan Brandt; Jozef Miškuf; Dieter Rautenbach 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 131 KB

## Abstract As our main result, we prove that for every multigraph __G__ = (__V, E__) which has no loops and is of order __n__, size __m__, and maximum degree $\Delta < {{{10}}^{-{{3}}}{{m}}\over \sqrt{{{8}}{{n}}}}$ there is a mapping ${{f}}:{{V}}\cup {{E}}\to \big\{{{1}},{{2}},\ldots,\big\lceil{{{