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

gcd³τAk(pe), τBk(pe)´ for all prime powerspeo that we gave for least upper bound does not hold in general

N/A
N/A
Protected

Academic year: 2022

シェア "gcd³τAk(pe), τBk(pe)´ for all prime powerspeo that we gave for least upper bound does not hold in general"

Copied!
2
0
0

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

全文

(1)

PORTUGALIAE MATHEMATICA Vol. 52 Fasc. 1 – 1995

ERRATA TO: COMPARISON OF REGULAR CONVOLUTIONS

Pentti Haukkanen

Abstract: My paper [1] gives an incorrect expression for least upper bound in the Browerian lattice (A/ε,≤). A corrected expression is given.

In this short note we correct an error of the paper [1]. We use the same notations as in [1] and assume that the reader is familiar with these notations.

In [1] we noted that (A/ε,≤) forms a Browerian lattice. This is true, but the expression

(1) (A/ε)∨(B/ε) =nC ∈A: τCk(pe) = gcd³τAk(pe), τBk(pe)´

for all prime powerspeo that we gave for least upper bound does not hold in general. For example, let k= 1 and

A(p4) =B(p4) ={1, p2, p4}, τA(p4) =τB(p4) = 2 , A(p6) ={1, p2, p4, p6}, τA(p6) = 2 ,

B(p6) ={1, p3, p6}, τB(p6) = 3 . Then (A/ε)∨(B/ε) ={C}, where

C(p4) ={1, p2, p4}, τC(p4) = gcd(2,2) = 2 , (2)

C(p6) ={1, p, p2, p3, p4, p5, p6}, τC(p6) = gcd(2,3) = 1 . (3)

Since C is regular, (3) implies that C(p4) ={1, p, p2, p3, p4}, τC(p4) = 1, which is in contradiction to (2).

Received: December 2, 1994.

AMS Subject Classification: 11A25.

(2)

40 PENTTI HAUKKANEN

Next, we derive an algorithm for computing τCk(pe) and thus correct (1).

Construct a decreasing sequence t1, t2, t3, ...of positive integers as follows:

t1= gcd³τAk(pe), τBk(pe)´ ,

t2= gcd³τAk(pt1), τAk(p2t1), ..., τAk(pr1t1), τBk(pt1), τBk(p2t1), ..., τBk(pr1t1)´, ...

tn+1= gcd³τAk(ptn), τAk(p2tn), ..., τAk(prntn), τBk(ptn), τBk(p2tn), ..., τBk(prntn)´ , where riti = e for i = 1,2, .... Now, let s denote the least integer such that ts =ts+1. Then

(4) τCk(pe) =ts .

ACKNOWLEDGEMENT– The author would like to thank Emil D. Schwab who brought the error to my attention.

REFERENCES

[1] Haukkanen, P. – Comparison of regular convolutions, Portug. Math., 46 (1989), 59–69.

Pentti Haukkanen,

Department of Mathematical Sciences, University of Tampere, P.O. Box 607, SF-33101 Tampere – FINLAND

参照

関連したドキュメント

The chromatic number of a graph G, denoted by χ(G), is the minimum number of colours required to colour the vertex set of G so that no two adjacent vertices are assigned the

Our main result below gives a new upper bound that, for large n, is better than all previous bounds..

This problem is a special case of finding an upper bound for the determinant of matrices whose entries are a permutation of an arithmetic progression:.

In Figure 6.2, we show the same state and observation process realisation, but in this case, the estimated filter probabilities have been computed using the robust recursion at

Abstract: In this paper we shall give another global upper bound for Jensen’s discrete in- equality which is better than existing ones.. On An Upper Bound Slavko Simic vol.. On An

The breakthrough papers of Cilleruelo, Ruzsa, Trujillo [3], Cilleruelo, Jim´enez-Urroz [2], and Green [4] introduced methods from analysis and probability to obtain

Keywords: sequence, Davenport-Schinzel sequence, length, upper bound AMS Subject Classification:

Lan, “The velocity and shear stress functions of the Falkner-Skan equation arising in boundary layer theory,” Journal of Mathematical Analysis and Applications, vol. Yang, “New