• 検索結果がありません。

Upper and Lower Bounds of the Discrepancy of the Sequence (αn + βnlogn)

N/A
N/A
Protected

Academic year: 2021

シェア "Upper and Lower Bounds of the Discrepancy of the Sequence (αn + βnlogn)"

Copied!
4
0
0

読み込み中.... (全文を見る)

全文

(1)

Upper and Lower Bounds ofthe lDiscrepancy ofthe Sequence

(伽

10g乃

)

GOTO,Kazuo*

l Abstract

We give upper and lower bounds of the discrepancy of the sequencc(α

η

tt

β

p10g婉).

Key words:Discrepancy,Exponenti』 Sums.

2000 Mathematics Subject Classirlcation,1lL07 or llK31,

2 Lenaュ

mas

The discrepancy DN of the given sequence αl,.中 ,αⅣ iS deined by

DN=墜

鴻 ≦

1卜

n:Щ

β一引 ,

whereス

(〔

α

,β):N)iS the nunber of terns whose fractional part is induded in tα,β)⊂ 10,11.

Lemma l(Erdbs and匂 氏■

hn inequality t2,Chap.2,2.51).F9″

α

,v″

ο

δ

ι

υ

9ぢ

ι

9_ ♂Cr ηι, υ9んαυ9

DN≦

+争

1畦

引・

Lemma 2(Gototll,TheOrem 3.1)。

(i)Lcι O≦ α

<l

αη」β

>o.FOr any(>0,υ

9 んαυ9

2Ttlα,十

β

%→

│≦

::│:::与

│三 :±

+ο

(▼

語 淫 考

)+ο

OOgり

' 切んctt ιん9 cοndιαttιd力れ ,Jぢ認 by ιんc O Ъαtt αbdο′包ιc αtt」 {露}万dιん9/Tacι づοttαど″ι9/2.

(li)あCι

O<β ≦

1/(21og 2)。 /br

α

O<(<1,り

9ん

α

υ

9

92Tilan拗

*Department of Regional Planning,F艇 lty of Educaion and Regional Sciences,Tottott University

(2)

1 146 GoTo,Kazuo:Upper and lower Bounds of he Discrepancy ofhe Sequencc(α ヵ十β″b8')

>単

薇 ・

}+ο

(寺 )+卿

鰯憫

≧」ケ

9-著

V・ (9弟

_1-5手

:下

[}+°

(ギ

)+ο

l10g凝

, υんcr9とん9 cο口婿ιαttιdぢmP′ガcJ by ιん

90る

αre αうじο′yι9,

3 Theorem

Throughtout this sectiont the cOnstants imphed by the<∈ are absolute.

Theorem■

.Forれ

cttPancy DN o/ι

c sc999ncc(α

η

p 10g■),り 9ん

αυ

9

DN≧

A券 ,つ

N≦

B需

ズ 恥

/OT Sο ttC Pο Sttυ C ω ttι αns A αpどB,υ んcrc,(Ⅳ)づS αηy力nct'οηυんゲcん ι9ηJs ttοttOιOttcα′Jv

ι

ο力が

,づ

ι

.

Pr99/0/TんCο

κ開

1,We setて

=lin Lemma 2.Then

♂πЖ

a71■p州

蛯→

│≦

寿 農

+ο

侍 吊 絡 巧

)+ο

ttgり

れο

)・

Ol10g Nl

≪vttVF.

TherefOre

睦♂

π

Ж

ttV強

│=岡

師獅

For any funcdOn♂ (党

)Whた

h tends monoto c』ly to inn ty,we have

#塊

券‰下

=0,

which implies that there e sts anハ

(ん,β)suCh that

(3)

鳥取大学教育地域科学部紀要 地域研究 第

3巻

2号 (2002) 147

By Lemma l,we have as pΥ

_)∞

DN≪

+逐

手凸側≪嘉

+券

bg駐

We choose阿

=〔

1/2].Then,by the dennition ofす

(η ),

DN≪

+持

刺嘘Ⅳ

≪需ズ嚇

for all N≧ maXttVo,(ん +1)2)。

By the tKN,Chap.2,Cor.5.1]and Lemma 2,we have

的 ≧陸μ陣拗劇

eXメ

獅 。

(eXメ

)-1-手

藉 寺

}+ο

(舟

)

Wherethecottail::ipliedbythe)>dependS On only

β

Therefore we have 4Ⅳ

DN≫

F if o<β

<1/(21og 2).

Refbrences

[1]K.Goto,

肋 η

9陀

dvJιS Oη うιι′cυοοするb胞阿 αれ 'OTJづ cz`PTob′9れ

, Math.」

.

Okayama uniV.41(1999),121-136,

pl L.Kuipers and H.Nttderrener,肋 Tれ

Dれ

Tづbvι】ο■ げ 鹿9留cnCCS,Wiley,1974.

[3〕 E.C.Titchmarsh and D.R.Heath―

Brown,Tん

cTん9οry 9/ιんc R19前ann zctα‐五ォηctiοれ,

second edition Reviced by D.R,Heath―

wn,Oxfordi1986.

Faculty of Education and Resional SCiences,

Tottori University,

Tottori―shi,680-0945,Japan

(4)

参照

関連したドキュメント

A number of previous papers have obtained heat kernel upper bounds for jump processes under similar conditions – see in particular [3, 5, 13]... Moreover, by the proof of [2,

Now it makes sense to ask if the curve x(s) has a tangent at the limit point x 0 ; this is exactly the formulation of the gradient conjecture in the Riemannian case.. By the

The nonlinear impulsive boundary value problem (IBVP) of the second order with nonlinear boundary conditions has been studied by many authors by the lower and upper functions

Inside this class, we identify a new subclass of Liouvillian integrable systems, under suitable conditions such Liouvillian integrable systems can have at most one limit cycle, and

Theorem 1. Tarnanen uses the conjugacy scheme of the group S n in order to obtain new upper bounds for the size of a permutation code. A distance that is both left- and right-

Erd˝ os, Some problems and results on combinatorial number theory, Graph theory and its applications, Ann.. New

A second way involves considering the number of non-trivial tree components, and using the observation that any non-trivial tree has at least two rigid 3-colourings: this approach

In 1965, Kolakoski [7] introduced an example of a self-generating sequence by creating the sequence defined in the following way..