On a problem of A. M. Odlyzko on algebraic units of bounded degree
✍ Scribed by K. Győry
- Publisher
- Akadmiai Kiad
- Year
- 1995
- Tongue
- English
- Weight
- 195 KB
- Volume
- 69
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Dirichlet proved that for any real irrational number ξ there exist infinitely many rational numbers p/q such that |ξp/q| < q -2 . The correct generalization to the case of approximation by algebraic numbers of degree n, n > 2, is still unknown. Here we prove a result which improves all previous esti
## Abstract A graph __G__ is degree‐bounded‐colorable (briefly, db‐colorable) if it can be properly vertex‐colored with colors 1,2, …, k ≤ Δ(__G__) such that each vertex __v__ is assigned a color __c__(__v__) ≤ __v__. We first prove that if a connected graph __G__ has a block which is neither a com