[PDF] Top 20 pages195-206. 200KB Jun 04 2011 12:06:58 AM

... IfK is a totally real cyclic number field of degreen= 2p= 22,26,34 or38 such that N ormK/KpUK =UKp andN ormK/K2UK =UK2, thenK contains a Minkowski unit if and only if the class of its [r] ... Lihat dokumen lengkap

... for n 6= 0, ±1. The main result obtained in [12] can be stated as follows: If |m| and |n| are sufficiently large and have sufficiently large common divisor, then the system has only the trivial solutions (V, Z, U) ... Lihat dokumen lengkap

... A proof may be found in [2, section 5]. In fact, [2] makes a far more precise statement. In related work, [12] gives a more general uniform dis- tribution result about rational functions in arbitrarily many ... Lihat dokumen lengkap

... 2-dimensional ramification theory In this section we assume that K is a 2-dimensional complete discrete valuation field of characteristic p provided with an additional structure given b[r] ... Lihat dokumen lengkap

... On the one hand, for R´enyi’s classical β-expansions it is well-known that the set of real numbers with ultimately periodic representation is Q(β) whenever β is a Pisot number [1, 12]. On the other hand, for ... Lihat dokumen lengkap

... prefixed finite set; more restrictive local behaviors can also be forced to occur (see [12] and [22]). In this direction, the best possible situation would be that every (admissible) prescribed local behavior at ... Lihat dokumen lengkap

... The set UDr of point sets ofRn, n ≥1, having the property that their minimal interpoint distance is greater than a given strictly positive constantr > 0 is shown to be equippable by a m[r] ... Lihat dokumen lengkap

... number p. If we take a positive number γ ∈ Q(α) such that σ(γ) = −γ , for instance, γ = α − σ(α) (one may replace α by −α, and so, we can suppose α − σ(α) > 0), then we have log(−σ(γ)/γ) = 0, and by (12), we ... Lihat dokumen lengkap

... The reader will check easily that the conjecture is valid for all cyclic groups of prime order when it is equivalent to the Erd˝os-Heilbronn conjecture; for the infinite cyclic group the[r] ... Lihat dokumen lengkap

... some suitably large power of p by lifting to the de Rham complex, where its action is given very explicitly, and performing some kind of cohomologi- cal reduction. This approach was first explored by Kedlaya, and seems ... Lihat dokumen lengkap

... i the given forms have a common nonsingular real solution, and either iia each form in the complex pencil has rank>4r2+ 4r, or iib each form in the rational pencil has rank >4r3+ 4r2.. [r] ... Lihat dokumen lengkap

... g-additive functions have been extensively discussed in the literature, in particular their asymptotic distribution, see [1, 3, 4, 5, 6, 7, 8, 9, 11, 12, 14, 15]. We cite three of these results (in a slightly ... Lihat dokumen lengkap

... We also dis-cuss the connections between the notion of Grassmannian design and the notion of design associated with the symmetric space of the totally isotropic subspaces in a binary qua[r] ... Lihat dokumen lengkap

... Remark that an imaginary quadratic order yields to consider definite bi-nary quadratic forms, and a real quadratic order yields to indefinite bibi-nary forms.. Therefore, by construction[r] ... Lihat dokumen lengkap

... At this step, we may finally complete the above list with several other values of the xi equal to 1 until we get a list with precisely t−1 numbers, which is possible by inequality 2.14 [r] ... Lihat dokumen lengkap

... iii If in the initial two eigenanalyses of the hermitian matricesHA and−iKA, the subsequently generated ellipse intersections with the line ℑz = ℑµ do not give us a generating vector pai[r] ... Lihat dokumen lengkap

... A publication of the International Linear Algebra Society.[r] ... Lihat dokumen lengkap

... From a block-ordered right coprime decomposition of a rational matrix of the given periodic collection, the corresponding block-ordered right coprime decompositions of the remaining matr[r] ... Lihat dokumen lengkap

... Algorithm 4 If successful this algorithm provides an interval matrixX containing an exact solvent of the quadratic matrix equation 1.2 1: Use a floating point algorithm to get an approx[r] ... Lihat dokumen lengkap

... Introduction For any positive integerk >1 we denote byPk the largest prime factor of k and by ωk the number of distinct prime divisors of k.. This bound is improved in [7] where it is s[r] ... Lihat dokumen lengkap