Let D be a division algebra of degree 3 over its center K and let J be an involution of the second kind on D. Let F be the subfield of K of elements invariant under J, char F / 3. We present a simple proof of a theorem of A. Albert on the existence of a maximal subfield of D which is Galois over F w
Diophantine Approximation with Algebraic Points of Bounded Degree
β Scribed by Min Ru; Julie Tzu-Yueh Wang
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 158 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper, we extend Schmidt's subspace theorem to the approximation of algebraic numbers by algebraic points of bounded degree. 2000 Academic Press 1. INTRODUCTION This paper deals with the Diophantine approximation with algebraic points of bounded degree. In 1955, Roth proved his celebrated theorem that for any real algebraic number :, and every }>2, the inequality |(xΓ y)&:| >(1Γmax[ |x|, | y| ] } ) holds for all, but finitely many (xΓ y) # Q.
Roth's theorem was extended by E. Wirsing in 1968 to the approximation of the algebraic number : by algebraic numbers of bounded degree. In 1970, W. Schmidt generalized Roth's theorem to the approximation of more than one algebraic number by rational points. In this paper, we extend Schmidt's theorem to the approximation by algebraic points of bounded degree. However, we could not fully obtain Wirsing's version of Schmidt's subspace theorem. This paper thus could be regarded as a first step towards the complete understanding of Diophantine approximation with algebraic points of bounded degree. We note that this paper is motivated by the recent discovered relationship between Diophantine approximation and Nevanlinna theory. See [Ru] for the further discussion.
π SIMILAR VOLUMES
## Abstract The number of independent vertex subsets is a graph parameter that is, apart from its purely mathematical importance, of interest in mathematical chemistry. In particular, the problem of maximizing or minimizing the number of independent vertex subsets within a given class of graphs has
## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in
Let m, n be positive integers and let : Z n Γ R be a non-negative function. Let W(m, n; ) be the set { X # R mn : " : n j=1 x ij q j " < (q), 1 i m, for infinitely many q # Z n = . The Hausdorff dimension of W(m, n; ) is obtained for arbitrary non-negative functions , with no monotonicity assumpti
## Abstract It is well known that certain graphβtheoretic extremal questions play a central role in the study of communication network vulnerability. Herein we consider a generalization of some of the classical results in this area. We define a (__p__, Ξ, Ξ΄, Ξ») graph as a graph having __p__ points,