๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On a linear diophantine problem for geometrical type sequences

โœ Scribed by Endre Boros

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
368 KB
Volume
66
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a linear diophantine problem of Frobe
On a linear diophantine problem of Frobenius
โœ G.R. Hofmeister; A.M. Ibrahim; G.A. Shadia ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB
On a non-linear geometrical inverse prob
On a non-linear geometrical inverse problem of Signorini type: identifiability and stability
โœ Amel Ben Abda; Slim Chaabane; Fadi El Dabaghi; Mohamed Jaoua ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 205 KB ๐Ÿ‘ 1 views

## Communicated by J. C. Nedelec This paper deals with a non-linear inverse problem of identification of unknown boundaries, on which the prescribed conditions are of Signorini type. We first prove an identifiability result, in both frameworks of thermal and elastic testing. Local Lipschitz stabil

On a Linear Diophantine Problem of Frobe
On a Linear Diophantine Problem of Frobenius: Extending the Basis
โœ Stefan Matthias Ritter ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 233 KB

Let X k =[a 1 , a 2 , ..., a k ], k>1, be a subset of N such that gcd(X k )=1. We shall say that a natural number n is dependent (on X k ) if there are nonnegative integers x i such that n has a representation n= k i=1 x i a i , else independent. The Frobenius number g(X k ) of X k is the greatest i

On a Reconstruction Problem for Sequence
On a Reconstruction Problem for Sequences
โœ I. Krasikov; Y. Roditty ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 439 KB

It is shown that any word of length n is uniquely determined by all its ( n k ) subwords of length k, provided k w 16 7 -nx+5. This improves the bound k wnร‚2x given in B. Manvel et al. (Discrete Math. 94 (1991), 209 219). 1997 Academic Press ## 1. Introduction Given a word X of length n with term