(2010) pp. 85–93
http://ami.ektf.hu
On the best estimations for dispersions of special ratio block sequences ∗
Ferdinánd Filip
a, Kálmán Liptai
bFerenc Mátyás
b, János T. Tóth
aaDepartment of Mathematics, J. Selye University
bInstitute of Mathematics and Informatics, Eszterházy Károly College Submitted 4 October 2010; Accepted 24 November 2010
Dedicated to professor Béla Pelle on his 80th birthday
Abstract
Properties of dispersion of block sequences were investigated by J. T. Tóth, L. Mišík, F. Filip [20]. The present paper is a continuation of the study of relations between the density of the block sequence and so called dispersion of the block sequence.
Keywords:dispersion, block sequence,(R)-density.
MSC:Primary 11B05.
1. Introduction
In this part we recall some basic definitions. Denote by N and R+ the set of all positive integers and positive real numbers, respectively. For X ⊂Nlet X(n) =
#{x∈X;x6n}. In the whole paper we will assume thatX is infinite. Denote by R(X) ={xy;x∈X, y∈X} theratio set of X and say that a setX is(R)-dense if R(X)is (topologically) dense in the setR+. Let us notice that the concept of (R)-density was defined and first studied in papers [17] and [18].
Now letX ={x1, x2, . . .}wherexn< xn+1are positive integers. The sequence x1
x1
,x1
x2
,x2
x2
,x1
x3
,x2
x3
,x3
x3
, . . . ,x1
xn
,x2
xn
, . . . ,xn
xn
, . . . (1.1)
∗Supported by grants APVV SK-HU-0009-08 and VEGA Grant no. 1/0753/10.
85
of finite sequences derived fromX is calledratio block sequenceof the setX. Thus the block sequence is formed by blocksX1, X2, . . . , Xn, . . .where
Xn = x1
xn
,x2
xn
, . . . ,xn
xn
; n= 1,2, . . . .
This kind of block sequences were studied in papers, [1] , [3] , [4] , [16] and [20]. Also other kinds of block sequences were studied by several authors, see [2], [6], [8], [12]
and [19]. Let Y = (yn)be an increasing sequence of positive integers. A sequence of blocks of type
Yn= 1
yn
, 2 yn
, . . . ,yn
yn
was invetigated in [11] which extends a result of [5]. Authors obtained a complete theory for the uniform distribution of the related block sequence(Yn).
For everyn∈Nlet D(Xn) = max
x1
xn
,x2−x1
xn
, . . . ,xi+1−xi
xn
, . . . ,xn−xn−1
xn
, the maximum distance between two consecutive terms in then-th block.
In this paper we will consider the characteristics (see [20]) D(X) = lim inf
n→∞ D(Xn),
called the dispersionof the block sequence (1.1) derived fromX, and its relations to the previously mentioned asymptotic density of the original setX.
At the end of this section, let us mention the concept of a dispersion of a general sequence of numbers in the intervalh0,1i. Let(xn)∞n=0be a sequence inh0,1i. For every N ∈ N letxi1 6 xi2 6. . . 6 xiN be reordering of its firstN terms into a nondecreasing sequence and denote
dN = 1 2max
max{xij+1−xij; j= 1,2, . . . N−1}, xi1,1−xiN
the dispersion of the finite sequence x0, x1, x2, . . . xN. Properties of this concept can be found for example in [10] where it is also proved that
lim sup
N→∞
N dN > 1 log 4
holds for every one-to-one infinite sequencexn ∈ h0,1i. Also notice that the density of the whole sequence(xn)∞n=0 is equivalent to lim
N→∞dN = 0. Also notice that the analogy of this property for the concept of dispersion of block sequences defined in the present paper does not hold.
Much more on these and related topics can be found in monograph [13].
2. Results
When calculating the valueD(X), the following theorems are often useful (See [20], Theorem 1, Corollary 1, respectively).
(A1) Let
X ={x1, x2, . . .}= [∞
n=1
(cn, dni ∩N,
wherexn< xn+1 and letcn< dn< cn+1, forn∈N, be positive integers. Then D(X) = lim inf
n→∞
max{ci+1−di:i= 1,2, . . . , n}
dn+1
.
(A2) Let X be identical to the form of X in (A1). Suppose that there exists a positive integern0 such that for all integersn > n0
cn+1−dn6cn+2−dn+1. Then
D(X) = lim inf
n→∞
cn+1−dn
dn+1
.
The basic properties of the dispersionD(X)and the relations between dispersion and(R)-density are investigated in the paper [TMF]. The next theorem states the upper bound for dispersionsD(X)of(R)-dense sets where16a= lim
n→∞
dn cn <∞ (See [20], Theorem 10).
(A3) LetX =S∞ n=1
cn, dn
E∩Nbe an(R)-dense set wherecn< dn < cn+1 for all n∈Nand suppose that the limit lim
n→∞
dn
cn =aexists. Then D(X)6min
1 a+ 1,max
a−1 a2 , 1
a2
,
more precisely,
D(X)6
1
1+a ifa∈ h1,1+2√5)
1
a2 ifa∈ h1+2√5,2)
a−1
a2 ifa∈ h2,∞).
The following theorem shows that in the third case (ifa>2), that the dispersion D(X)can be any number in the interval
0,aa−21
, whereX =S∞
n=1
cn, dn
E∩Nis (R)-dense and lim
n→∞
dn
cn =a. Thus the upper bound forD(X)is the best possible in the casea>2(See [4], Theorem 2).
(A4) Leta>1 be a real number andk be an arbitrary natural number. Then for everyα∈ h0,aka2k−1ithere exists an(R)-dense set
X =
∞
[
n=1
(cn, dni ∩N
wherecn< dn< cn+1are positive integers for everyn∈N, such that lim
n→∞
dn cn =a andD(X) =α.
In this paper we prove that in the second case ifa∈D
1+√ 5 2 ,2
, the dispersion D(X) can be any number in the interval
0,a12
, whereX = ∞S
n=1
cn, dn
E∩N is (R)-dense and lim
n→∞
dn
cn =a. Thus the upper bound forD(X)is the best possible in the casea∈D
1+√ 5 2 ,2
. The following lemma will be useful.
Lemma 2.1. Let the set
M(X) ={n∈N:cn+1−dn= max{ci+1−di:i= 1,2, . . . , n}}=
={m1< m2<· · ·< mk < . . .} be infinite. Then
D(X) = lim inf
k→∞
cmk+1−dmk
dmk+1
.
Proof. Letn∈Nbe an arbitrary integer such thatn>m1. Then there is unique k∈Nwithmk6n < mk+1. >From the definition of the setM(X)we obtain
max{ci+1−di:i= 1,2, . . . , n}
dn+1
=cmk+1−dmk
dn+1
>cmk+1−dmk
dmk+1
. Then obviously
D(X) = lim inf
n→∞
max{ci+1−di :i= 1,2, . . . , n}
dn+1
>lim inf
k→∞
cmk+1−dmk
dmk+1
.
On the other hand, the sequence cmkd+1−dmk
mk+1
∞
k=1 is a subsequence of the sequence max
{ci+1−di:i=1,2,...,n} dn+1
n∈N, hence D(X) = lim inf
n→∞
max{ci+1−di :i= 1,2, . . . , n}
dn+1
6lim inf
k→∞
cmk+1−dmk
dmk+1
. The last two inequalities imply
D(X) = lim inf
k→∞
cmk+1−dmk
dmk+1
.
Theorem 2.2. Let a ∈ 1+√ 5 2 ,2
be an arbitrary real number. Then for every α∈ h0,a12ithere is an (R)-dense set
X=
∞
[
n=1
(cn, dni ∩N,
where cn < dn < cn+1 are positive integers for every n∈Nsuch that lim
n→∞
dn
cn =a andD(X) =α.
Proof. Let a ∈ h1+2√5,2). According to (A4), it is sufficient to prove Theorem 2.2 for aa−21 < α 6 1
a2. Define function f(b) = bab−1. Clearlyf is continuous and increasing on the interval ha,∞). Moreover
f(a) = a−1
a2 and f(a2) = a2−1 a3 . We have a2a−31 >a12 ifa> 1+
√5
2 . Thus there exists a real numbera < b6a2such
that b−1
ab =α.
Define a setX ⊂Nby
X =
∞
[
n=1
An∪Bn
∩N,
where for everyn∈N
An = (an,1, bn,1i ∪(an,2, bn,2i a Bn=
n
[
k=1
(cn,k, dn,ki.
Put a1,1= 1and for everyn∈Nandk= 2,3, . . . , n bn,1= [aan,1] + 1, an,2=bn,1+ 1, bn,2= [aan,2] + 1,
cn,1= [bbn,2] + 1, dn,1= [acn1] + 1, cn,k= [bdn,k−1] + 1, dn,k = [acn,k] + 1, andan+1,1= (n+ 1)dn,n.
Obviously for everyn∈N a < bn,1
an,1
6a+ 1
an,1
and a < bn,1
an,1
6a+ 1
an,1
, and fork= 1,2, . . . , n
a < dn,k
cn,k
6a+ 1
an,1
.
First we prove thatD(X) =α. We have the following inequalities:
cn+1,1−bn+1,2>bbn+1,2−bn+1,2>(b−1)bn+1,2>(b−1)a2an+1,1>
>(a−1)a2an+1,1>aan+1,1> an+1,1> an+1,1−dn,n
The inequalitya2(a−1)>afollows froma> 1+√5
2 . Then
cn,2−dn,1>bdn,1−dn,1= (b−1)dn,1>(b−1)acn,1>(a−1)acn,1>cn,1> cn,1−bn,2
and for everyk= 2,3, . . . , n−1
cn,k+1−dn,k>bdn,k−dn,k = (b−1)dn,k >(b−1)acn,k>
>(a−1)acn,k >cn,k> cn,k−dn,k−1. Finally
an+2,1−dn+1,n+1= (n+ 2)dn+1,n+1−dn+1,n+1>
> dn+1,n+1> cn+1,n+1> cn+1,n+1−dn+1,n.
From the above inequalities we have for a sufficiently large n ∈ N the following inequalities:
1 =an,2−bn,1< an,1−dn−1,n−1< cn,1−bn,2< cn,2−dn,1< . . .
· · ·< cn,n−dn,n−1< an+1,1−dn,n. (2.1) Now we use Lemma 2.1. From (2.1) one can see that it is sufficient to study the quotients:
a)an+1,1bn+1,2−dn,n, b)cn,1d−bn,2
n,1 ,
c)cn,k−dn,kdn,k−1 fork= 2,3, . . . , n.
In case a)
lim inf
n→∞
an+1,1−dn,n
bn+1,2
= lim inf
n→∞
(n−1)dn,n
na2dn,n
= 1 a2 >α, in case b)
lim inf
n→∞
cn,1−bn,2
dn,1
= lim inf
n→∞
(b−1)bn,2
abbn,2
= b−1 ab =α and in case c)
cn,k−dn,k−1
dn,k
6 (b−1)dn,k−1+ 1 abdn,k−1
6 b−1
ab + 1
abdn,k−1
6α+ 1
abdn,1
and cn,k−dn,k−1
dn,k
> (b−1)dn,k−1
abdn,k−1+b+ 1 >
> b−1
ab −b−1 ab
b+ 1
abdn,k−1+b+ 1 >α−b2−1 dn,1
. From this it is obvious thatD(X) =α.
It remains to prove that the setXis(R)-dense. We have a12 61
b andbla1l+2 6 1
bl+1al
for everyl= 1,2, . . ., hence
1 a2,1E
∪ [∞
l=1
1 blal+2, 1
blal−1
E= (0,1i
and it is sufficient to prove that the ratio set of the setX is dense on intervals 1
a2,1E
and 1
blal+2, 1 blal−l
E
for everyl= 1,2, . . ..
Now we prove that the ratio set ofX is dense on
1 a2,1E
. Let(e, f)⊂
1 a2,1E
. Put ε=f −e. Consider the set
nan,1+ 1 bn,2
<an,1+ 2 bn,2
<· · ·< bn,1
bn,2
<
< an,2+ 1 bn,2
< an,2+ 2 bn,2
<· · ·< bn,2−1 bn,2
<bn,2
bn,2
= 1o ,
(2.2)
which is obviously a subset of the ratio set of X. The largest difference between consecutive terms of (2.2) is b2
n,2. Then an,1+ 1
bn,2
= an,1
bn,2
+ 1 bn,2
6 an,1
a2an,1
+ 1 bn,2
= 1 a2 + 1
bn,2
. If we choosen∈Nso thatb2
n,2 < ε, then the interval(e, f)is not disjoint with (2.2), hence the ratio set of X is dense in the interval
1 a2,1E
.
Letl∈Nbe arbitrary. We prove that the ratio set ofX is dense in the interval 1
blal+2,bla1l−1
E. Let (e, f)⊂
1
blal+2,bla1l−1
E. Put ε =f −e. Choose n1 ∈N so that n1> l andan,1+ 1> 2ε for everyn > n1. Consider the set
n bn,2
cn,l+ 1 >bn,2−1
cn,l+ 1 >· · ·> an,2+ 1
cn,l+ 1 > bn,1
cn,l+ 1 >
>bn,1−1
cn,l+ 1 >· · ·> an,1+ 1
cn,l+ 1 > an,1+ 1
cn,l+ 2 >· · ·> an,1+ 1 dn,l
o ,
(2.3)
which is obviously a subset of the ratio set of X. The largest difference between consecutive terms of (2.3) is 6a 2
n,1+1. On the other hand,
nlim→∞
bn,2
cn,l+ 1 = 1
blal−1 and lim
n→∞
an,1+ 1 dn,l
= 1
blal+2 . Then there existsn2∈N, such that for everyn > n2
bn,2
cn,l+ 1 > 1
blal−1 −ε and an,1+ 1 dn,l
< 1
blal+2 +ε .
If we choose n > max{n1, n2}, then the interval (e, f) is not disjoint with (2.3), hence the ratio set of X is dense in the interval bl,a1l+2,bl,a1l−1
. This concludes
the proof.
References
[1] Bukor, J., Csiba, P., On estimations of dispersion of ratio block sequences,Math.
Slovaca, 59 (2009), 283–290.
[2] Hlawka, E., The theory of uniform distribution,AB Academic publishers, London, 1984.
[3] Filip, F., Mišík, L.,Tóth, J. T.,Dispersion of ratio block sequences and asymp- totic density,Acta Arith., 131 (2008), 183–191.
[4] Filip, F., Tóth, J. T., On estimations of dispersions of certain dense block se- quences,Tatra Mt. Math. Publ., 31 (2005), 65–74.
[5] Knapowski, S., Über ein Problem der Gleichverteilung, Colloq. Math., 5 (1958), 8–10.
[6] Kuipers, L., Niederreiter, H., Uniform distribution of sequences,John Wiley &
Sons, New York, 1974.
[7] Mišík, L., Sets of positive integers with prescribed values of densities,Math. Slovaca, 52 (2002), 289–296.
[8] Myerson, G., A sampler of recent developments in the distribution of sequences, Number theory with an emphasis on the Markoff spectrum (Provo, UT, 1991) vol.147, Marcel Dekker, New York, (1993) 163–190.
[9] Mišík, L., Tóth, J. T., Logarithmic density of sequence of integers and density of its ratio set,Journal de Théorie des Nombers de Bordeaux, 15 (2003), 309–318.
[10] Niederreiter, H.,On a mesaure of denseness for sequences, in: Topics in Classical Number Theory, Vol. I., II., (G. Halász Ed.), (Budapest 1981), Colloq. Math. Soc.
János Bolyai, Vol. 34, Nort-Holland, Amsterdam, (1984) 1163–1208.
[11] Porubský, Š., Šalát, T. and Strauch, O., On a class of uniform distributed sequences,Math. Slovaca, 40 (1990), 143–170.
[12] Schoenberg, I. J., Über die asymptotische Vertaeilung reeler Zahlen mod 1,Math.
Z., 28 (1928), 171–199.
[13] Strauch, O., Porubský, Š.,Distribution of Sequences: A Sampler, Peter Lang, Frankfurt am Main, 2005.
[14] Strauch, O., Tóth, J. T., Asymptotic density ofA⊂Nand density of the ratio setR(A),Acta Arith., 87 (1998), 67–78.
[15] Strauch, O., Tóth, J. T., Corrigendum to Theorem 5 of the paper “Asymptotic density ofA⊂Nand density of the ratio setR(A)”,Acta Arith., 87 (1998), 67–78, Acta Arith., 103.2 (2002), 191–200.
[16] Strauch, O., Tóth, J. T., Distribution functions of ratio sequences,Publ. Math.
Debrecen, 58 (2001), 751–778.
[17] Šalát, T., On ratio sets of sets of natural numbers, Acta Arith., 15 (1969), 273–278.
[18] Šalát, T., Quotientbasen und (R)-dichte Mengen,Acta Arith., 19 (1971), 63–78.
[19] Tichy, R. F., Three examples of triangular arrays with optimal discrepancy and linear recurrences,Applications of Fibonacci numbers, 7 (1998), 415–423.
[20] Tóth, J. T., Mišík, L., Filip, F., On some properties of dispersion of block sequences of positive integers,Math. Slovaca, 54 (2004), 453–464.
Ferdinánd Filip,János T. Tóth Department of Mathematics J. Selye University
Bratislavská cesta 3322 945 01 Komárno Slovakia
e-mail: filip.ferdinand@selyeuni.sk toth.janos@selyeuni.sk Kálmán Liptai,Ferenc Mátyás Institute of Mathematics and Informatics Eszterházy Károly College
H-3300 Eger Leányka út 4.
Hungary
e-mail: liptaik@ektf.hu matyas@ektf.hu