𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Order of a Minimal Additive Basis

✍ Scribed by Georges Grekos


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
130 KB
Volume
71
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

✦ Synopsis


Let A be a set of non-negative integers. If every sufficiently large integer is the sum of h not necessarily distinct elements of A, then A is called an asymptotic basis of order h. An asymptotic basis A of order h is called minimal if no proper subset of A is an asymptotic basis of order h. It is proved that for every integer h 3, no set A is simultaneously a minimal asymptotic basis of orders h and 2h. For h=2, the problem had already been solved.


πŸ“œ SIMILAR VOLUMES


Hyperinterpolation on the Sphere at the
✍ Manfred Reimer πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 135 KB

dedicated to professor dr. dr. h. c. karl zeller on the occasion of his 75th birthday We investigate hyperinterpolation operators based on positive weighted quadrature rules, as introduced by Ian H. Sloan. If the rules are exact of double degree then, independently of the number of their nodes, the

On the Minimal Extension ofC0-Semigroups
✍ Julio R Claeyssen; V Schuchman πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 153 KB

The present paper deals with a minimal extension of the classical semigroup theory for second-order damped differential equations in Banach spaces with closed, densely defined linear operators as coefficients. We do not ask anymore from our operators than in the case of first-order equations, i.e.,

The Minimal Basis for the Centre of an I
✍ Andrew Francis πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 217 KB

This paper arose out of an attempt to generalize the q q -1 -basis for the centre of an Iwahori-Hecke algebra q found by Jones to q q -1 and to other types. Considering the Iwahori-Hecke algebra over a subring ΞΎ of q 1/2 q -1/2 , where ΞΎ = q 1/2q -1/2 , we use a new and natural definition of positiv

Revised Greedy algorithm for formation o
✍ Kaveh, A. ;Roosta, G. R. πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 356 KB πŸ‘ 1 views

## SUM MARY An efficient algorithm is developed for the formation of a minimal cycle basis of a graph. This method reduces the number of cycles to be considered as (candidates for being the elements of a minimal basis and makes practical use of the Greedy algorithm feasible. A comparison is made b