The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 461 –
480 of
507
For k ≥ 2, the k-generalized Fibonacci sequence is defined to have the initial k terms 0,0,...,0,1 and be such that each term afterwards is the sum of the k preceding terms. We will prove that the number of solutions of the Diophantine equation (under some weak assumptions) is bounded by an effectively computable constant depending only on c.
The spectrum of a weighted Dirac comb on the Thue-Morse quasicrystal is investigated by means of the Bombieri-Taylor conjecture, for Bragg peaks, and of a new conjecture that we call Aubry-Godrèche-Luck conjecture, for the singular continuous component. The decomposition of the Fourier transform of the weighted Dirac comb is obtained in terms of tempered distributions. We show that the asymptotic arithmetics of the -rarefied sums of the Thue-Morse sequence (Dumont; Goldstein, Kelly and Speer; Grabner;...
In [11] and [7], the concepts of σ-core and statistical core of a bounded number sequence x have been introduced and also some inequalities which are analogues of Knopp’s core theorem have been proved. In this paper, we characterize the matrices of the class and determine necessary and sufficient conditions for a matrix A to satisfy σ-core(Ax) ⊆ st-core(x) for all x ∈ m.
We study the structure of longest sequences in which have no zero-sum subsequence of length n (or less). We prove, among other results, that for and d arbitrary, or and d = 3, every sequence of c(n,d)(n-1) elements in which has no zero-sum subsequence of length n consists of c(n,d) distinct elements each appearing n-1 times, where and .
Let K be a finite set of lattice points in a plane. We prove that if |K| is sufficiently large and |K+K| < (4 - 2/s)|K| - (2s-1), then there exist s - 1 parallel lines which cover K. We also obtain some more precise structure theorems for the cases s = 3 and s = 4.
Let b ≥ 2 be a fixed positive integer. We show for a wide variety of sequences {a n}n=1∞ that for almost all n the sum of digits of a n in base b is at least c b log n, where c b is a constant depending on b and on the sequence. Our approach covers several integer sequences arising from number theory and combinatorics.
We show that for any relatively prime integers 1 ≤ p < q and for any finite A ⊂ ℤ one has .
Romanoff (1934) showed that integers that are the sum of a prime and a power of 2 have positive lower asymptotic density in the positive integers. We adapt his method by showing more generally the existence of a positive lower asymptotic density for integers that are the sum of a prime and a term of a given nonconstant nondegenerate integral linear recurrence with separable characteristic polynomial.
Currently displaying 461 –
480 of
507