Proof of a conjecture of nirenberg
โ Scribed by Robert Osserman
- Publisher
- John Wiley and Sons
- Year
- 1959
- Tongue
- English
- Weight
- 209 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0010-3640
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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))
Here we give a self-contained new proof of the partial regularity theorems for solutions of incompressible Navier-Stokes equations in three spatial dimensions. These results were originally due to Scheffer and Caffarelli, Kohn, and Nirenberg. Our proof is much more direct and simpler.
A tree T is said to be bad, if it is the vertex-disjoint union of two stars plus an edge joining the center of the first star to an end-vertex of the second star. A tree T is good, if it is not bad. In this article, we prove a conjecture of Alan Hartman that, for any spanning tree T of K 2m , where
Simion had a unimodality conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. Hildebrand recently showed the stronger result that these numbers are log concave. Here we present a simple proof of Hildebrand's result.
We give a new and elementary proof that the equation x 3 &1=31y 2 has only the integral solutions (x, y)=(1, 0), (5, 2), (5, &2).