𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact order of subsets of asymptotic bases in additive number theory

✍ Scribed by Xing-De Jia

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
422 KB
Volume
28
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a Problem of ErdΓΆs in Additive Number
On a Problem of ErdΓΆs in Additive Number Theory
✍ Dieter Wolke πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 263 KB

In 1954 Lorentz and Erdo s showed that there are very thin sets of positive integers complementary to the set of primes. In particular, there is an A N with (ii) every n n 0 can be written as n=a+ p, a # A, p prime. Erdo s conjectured that the bound (i) could be sharpened to o(ln 2 x) or even O(ln

Higher Order Asymptotic Theory for Discr
Higher Order Asymptotic Theory for Discriminant Analysis in Exponential Families of Distributions
✍ M. Taniguchi πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 595 KB

This paper deals with the problem of classifying a multivariate observation \(X\) into one of two populations \(\Pi_{1}: p\left(\mathbf{x} ; w^{(1)}\right) \in S\) and \(\Pi_{2}: p\left(\mathbf{x} ; w^{(2)}\right) \in S\), where \(S\) is an exponential family of distributions and \(w^{(1)}\) and \(w

GrΓΆbner Bases in Orders of Algebraic Num
GrΓΆbner Bases in Orders of Algebraic Number Fields
✍ David Andrew Smith πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 281 KB

We prove that any order O of any algebraic number field K is a reduction ring. Rather than showing the axioms for a reduction ring hold, we start from scratch by well-ordering O, defining a division algorithm, and demonstrating how to use it in a Buchberger algorithm which computes a GrΓΆbner basis g