On one of Graffiti's conjecture (583)
โ Scribed by Wang Liuxing
- Publisher
- Springer
- Year
- 1997
- Tongue
- English
- Weight
- 117 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0253-4827
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approxima
Kummer conjectured the asymptotic behavior of the first factor of the class number of a cyclotomic field. If we only ask for upper and lower bounds of the order of growth predicted by Kummer, then this modified Kummer conjecture is true for almost all primes.
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.