A non-isolated vertex of a graph G is called a groupie if the average degree of the vertices connected to it is larger than or equal to the average degree of the vertices in G. An isolated vertex is a groupie only if all vertices of G are isolated. While it is well known that every graph must contai
A Lower Bound for the Height in Abelian Extensions
โ Scribed by Francesco Amoroso; Roberto Dvornicich
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 172 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
โฆ Synopsis
We produce an absolute lower bound for the height of the algebraic numbers (different from zero and from the roots of unity) lying in an abelian extension of the rationals. The proof rests on elementary congruences in cyclotomic fields and on Kronecker Weber theorem.
๐ SIMILAR VOLUMES
We show that there exists an infinite sequence of sums P: a+b=c of rational integers with large height compared to the radical: h(P) r(P)+4K l -h(P)รlog h(P) with K l =2 lร2 4 -2?รe>1.517 for l=0.5990. This improves the result of Stewart and Tijdeman [9]. The value of l comes from an asymptotic boun
Interval routing is a space-efficient routing method for point-to-point communication networks. The method has drawn considerable attention in recent years because of its being incorporated into the design of a commercially available routing chip. The method is based on proper labeling of edges of t
Using the "nite element method, the static and kinematic methods of limit analysis provide tools to solve many stability problems in mechanics of continuous media. The classic problem of the height limit of a Tresca or Mises vertical slope subjected to the action of gravity stems naturally from this